05-longest-uncommon-subsequence-i.cpp

// https://leetcode-cn.com/problems/longest-uncommon-subsequence-i/

class Solution {
public:
    int findLUSlength(string a, string b) {
        if(a==b){
            return -1;
        }
        return max(a.size(),b.size());
    }
};