JAVA_Longest Uncommon Subsequence I_LeetCode 521

JAVA_Longest Uncommon Subsequence I_LeetCode 521 풀이 class Solution { public int findLUSlength(String a, String b) { return a.equals(b) ? -1 : Math.max(a.length(), b.length()); } } * 출처 Longest Uncommon Subsequence I - LeetCode Longest Uncommon Subsequence I - Given two strings a and b, return the length of the longest uncommon subsequence between a and b. If the longest uncommon subsequence does not exist, return -1. An uncommon subsequence between two strings is a string that is a subsequence o...

원문링크 : JAVA_Longest Uncommon Subsequence I_LeetCode 521