Given two strings a and b, return the length of the longest uncommon subsequence between a and b. If the longest uncommon subsequence does not exist, return -1.

An uncommon subsequence between two strings is a string that is a subsequence of one but not the other.

A subsequence of a string s is a string that can be obtained after deleting any number of characters from s.


	For example, "abc" is a subsequence of "aebdc" because you can delete the underlined characters in "aebdc" to get "abc". Other subsequences of "aebdc" include "aebdc", "aeb", and "" (empty string).


&nbsp;
Example 1:

Input: a = "aba", b = "cdc"
Output: 3
Explanation: One longest uncommon subsequence is "aba" because "aba" is a subsequence of "aba" but not "cdc".
Note that "cdc" is also a longest uncommon subsequence.


Example 2:

Input: a = "aaa", b = "bbb"
Output: 3
Explanation:&nbsp;The longest uncommon subsequences are "aaa" and "bbb".


Example 3:

Input: a = "aaa", b = "aaa"
Output: -1
Explanation:&nbsp;Every subsequence of string a is also a subsequence of string b. Similarly, every subsequence of string b is also a subsequence of string a.


&nbsp;
Constraints:


	1 &lt;= a.length, b.length &lt;= 100
	a and b consist of lower-case English letters.


class Solution:
    def findLUSlength(self, a: str, b: str) -> int:
        if a == b:
            return -1

        else:
            return max(len(a), len(b))
class Solution {
    public int findLUSlength(String a, String b) {
        if(a.equals(b)) return -1;
        return Math.max(a.length(),b.length());
    }
}
class Solution {
public:
    int findLUSlength(string a, string b) {
        if(a==b){
            return -1;
        }
        if(a.size()>=b.size()){
            return a.size();
        }
        return b.size();
    }
};
var findLUSlength = function(a, b) {
    if (a===b) return -1
    return Math.max(a.length,b.length)

};
Longest Uncommon Subsequence I