原题链接:Leetcode 521. Longest Uncommon Subsequence I
Given two strings a
and b
, return the length of the longest uncommon subsequence between a
and b
. If the longest uncommon subsequence does not exist, return -1
.
An uncommon subsequence between two strings is a string that is a subsequence of one but not the other.
A subsequence of a string s is a string that can be obtained after deleting any number of characters from s.
For example, “abc
” is a subsequence of “aebdc
” because you can delete the underlined characters in “aebdc
” to get “abc
”. Other subsequences of “aebdc
” include “aebdc
”, “aeb
”, and “” (empty string).
Example 1:
Input: a = "aba", b = "cdc"
Output: 3
Explanation: One longest uncommon subsequence is "aba" because "aba" is a subsequence of "aba" but not "cdc".
Note that "cdc" is also a longest uncommon subsequence.
Example 2:
Input: a = "aaa", b = "bbb"
Output: 3
Explanation: The longest uncommon subsequences are "aaa" and "bbb".
Example 3:
Input: a = "aaa", b = "aaa"
Output: -1
Explanation: Every subsequence of string a is also a subsequence of string b. Similarly, every subsequence of string b is also a subsequence of string a.
Constraints:
- 1 <= a.length, b.length <= 100
- a and b consist of lower-case English letters.
做法一:思维
思路:
有三种情况:
- 如果两个字符串长度不一样,那么更长的那个字符串本身显然符合最长独有子串;
- 如果长度相同,那么对于a或者b来说,它本身就是答案;
- 如果a和b相等,则返回-1
python代码:
class Solution:
def findLUSlength(self, a: str, b: str) -> int:
return max(len(a), len(b)) if a != b else -1
复杂度分析:
时间复杂度:O(max(n, m)) 复杂度和最大长度成正比
空间复杂度:O(1)