题目大意:求2个字符串最长的不同子序列的长度。
Problem:
https://leetcode.com/problems/longest-uncommon-subsequence-i/description/
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:
1 2 3 4 5 |
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.
Idea:
If two strings are the same, then the longest uncommon sequence does not exist, return -1.
e.g. aaa vs aaa, return -1
Otherwise, the longer string is always a uncommon sequence of the shorter one.
e.g. aaab vs aaa, return 4
Solution 1:
Time complexity: O(n)
Space complexity: O(1)
C++
1 2 3 4 5 6 7 8 |
// Author: Huahua // Running time: 3 ms class Solution { public: int findLUSlength(string a, string b) { return a == b ? -1 : max(a.length(), b.length()); } }; |
Java
1 2 3 4 5 6 7 |
// Author: Huahua // Running time: 3 ms class Solution { public int findLUSlength(String a, String b) { return a.equals(b) ? -1 : Math.max(a.length(), b.length()); } } |
Python3
1 2 3 4 5 6 7 8 9 10 |
""" Author: Huahua Running time: 40 ms (beats 100%) Website: http://zxi.mytechroad.com/blog/string/leetcode-521-longest-uncommon-subsequence-i/ """ class Solution: def findLUSlength(self, a, b): la, lb = len(a), len(b) if la != lb: return max(la, lb) return -1 if a == b else la |
请尊重作者的劳动成果,转载请注明出处!花花保留对文章/视频的所有权利。
如果您喜欢这篇文章/视频,欢迎您捐赠花花。
If you like my articles / videos, donations are welcome.
Be First to Comment