头像

带翅膀的猫

时光荏苒,我们一直都在

《LeetCode刷题(Easy Rank):521. Longest Uncommon Subsequence I》

 3周前  •   LeetCode  •     •   7  •   0

Question:

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.

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:

示例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. 

Solution:

Pythonclass Solution:
    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))

 

上一篇:
下一篇:

 评论


 已有0条评论

    还没有任何评论,你来说两句吧!