Longest Uncommon Subsequence I LeetCode solution in Java

1
class Solution {
2
public int findLUSlength(String a, String b) {
3
if (a.equals(b)) return -1;
4
return Math.max(a.length(), b.length());
5
}
6
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0