Longest Uncommon Subsequence I LeetCode solution in C++

1
class Solution {
2
public:
3
int findLUSlength(string a, string b) {
4
if (a == b) {
5
return -1;
6
}
7
if (a.size() >= b.size()) {
8
return a.size();
9
}
10
return b.size();
11
}
12
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0