leetcode——Longest Uncommon Subsequence I

python——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.

大致思路：
1）每个字符串的最大子序列的长度肯定是字符串本身的长度
2）若两字符串相同，则没有最大非公共子序列
3）若两字符串不相同，则返回较大字符串的长度

代码如下：

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

时间：
2019.2.23 武汉 晴转多云