leetcode 521. Longest Uncommon Subsequence I

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.

Example 1:

Input: "aba", "cdc"Output: 3Explanation: The longest uncommon subsequence is "aba" (or "cdc"), 
because "aba" is a subsequence of "aba", 
but not a subsequence of any other strings in the group of two strings. 

Note:

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

奉劝大家仔细想好再code。这个题目真是有毛病，开什么愚人节的玩笑，说的一本正经的，还什么不超过100。导致很多人都over-thinking into it.

这个题目主要解法就是：如果两个字符串相等，那返回-1。如果不相等，最长不相等子串就是两者中长度较大的那一串。

public int findLUSlength(String a, String b) {if(a.equals(b)){return -1;}int aLength=a.length();int bLength=b.length();if(aLength>bLength){return aLength;}else if(aLength<bLength){return bLength;}else{return aLength;}}

大神一行就解决了

public int findLUSlength(String a, String b) {    return a.equals(b) ? -1 : Math.max(a.length(), b.length());}