521. Longest Uncommon Subsequence I

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

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

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