【LeetCode】521. Longest Uncommon Subsequence I

Python版本：python3.6.2

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: 3
Explanation: 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:
Both strings' lengths will not exceed 100.
Only letters from a ~ z will appear in input strings

自己的代码：

class Solution:
    def findLUSlength(self, a, b):
        """
        :type a: str
        :type b: str
        :rtype: int
        """
        return -1 if a == b else max(len(a), len(b))

这一题撸了好久，本来以为还挺难，其实是自己被题目给吓住了，其实思想很简单。问题意思是给定两个字符串，求出不重复的最大子字符串，那么不重复的子字符串的意思就是，这个子字符串不存在与另一个给出的字符串中，题目只给了一个例子，自己应该多想几个例子的。

其实一行速度也很慢：

看了discussion，好多人都在吐槽题目作者啊，题目说的绕乎乎的。