Tech Base

Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not be any subsequence of the other strings.

A subsequence is a sequence that can be derived from one sequence by deleting some characters without changing the order of the remaining elements. Trivially, any string is a subsequence of itself and an empty string is a subsequence of any string.

The input will be two strings, and the output needs to be the length of the longest uncommon subsequence. If the longest uncommon subsequence doesn't exist, return -1

Note:

1. Both strings' lengths will not exceed 100.
2. Only letters from a ~ z will appear in input strings.

• 字串長的不可能會是短字串的 subsequence
• 單字串最常 subsequence 就是自己
• 兩字串相等，代表兩字串互為 subsequence

綜上所述，可以簡單寫出答案

class Solution {
    public int findLUSlength(String a, String b) {
        if(a.equals(b)) return -1;
        
        return a.length() >= b.length() ? a.length() : b.length();
    }
}