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:
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.
Analysis
(在朋友圈看到学姐被这道题虚晃一下……大概做多了LCS会思维定式吧……)
这里要找最长非公共字串。如果两字符串相等,则不存在最长非公共字串;如果不相等,显然较长的那个字符串(也包含两字符串内容不同,长度相同的情况)便是满足条件的答案。
Code
class Solution {
public:
int findLUSlength(string a, string b) {
return (a == b)? -1: max(a.size(),b.size());
}
};
“`
Appendix
- Link: https://leetcode.com/problems/longest-uncommon-subsequence-i/
- Run Time: 3ms