521. Longest Uncommon Subsequence I

static int wing=[]()
{
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();

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

骚题目，看看就好，认真你就输了