[LeetCode]521. Longest Uncommon Subsequence I(最长不寻常的序列 I)

521. 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.

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.(两个字符串的长度不会超过100。)
• Only letters from a ~ z will appear in input strings.(只有a〜z之间的字母才会出现在输入字符串中。)

题目大意：(谷歌翻译)
给定一组两个的字符串，您需要找到这组两个字符串中最长的不常见的子序列。 最长的不常见的子序列被定义为这些字符串之一的最长子序列，并且该子序列不应该是其他字符串的任何子序列。
子序列是可以通过删除一些字符而不改变剩余元素的顺序从一个序列导出的序列。 简而言之，任何字符串本身都是一个子序列，空字符串是任何字符串的子序列。
输入将是两个字符串，输出需要是最长的不常见子序列的长度。 如果最长不常见的子序列不存在，则返回-1。

我刚开始题意理解错了，错误思路是
- 把两数组的相同元素全部换成‘A’
- 寻找两数组除A外最长子序列长度
- 返回比较比的最长子序列长度
错误代码如下：

int findLUSlength(string a, string b) {
        if(a == b)
            return -1;
        for(int m=0; m<a.length(); m++){
            for(int n=0; n<b.length(); n++){
                if(a[m] == b[n]){
                    a[m] = 'A';
                    b[n] = 'A';
                }
            }
        }
        int a_Max = NotA_findLSlength(a);
        int b_Max = NotA_findLSlength(b);
        return a_Max>b_Max ? a_Max : b_Max;
    }
    int NotA_findLSlength(string Array){
        int Max = 0;
        int temp = 0;
        for(int m=0; m<Array.length(); m++){
            if(Array[m] != 'A')
                ++temp;
            if(Array[m] == 'A' && temp > Max){
                Max = temp;
                temp = 0;
            }
        }
        if(temp > Max)
            Max = temp;
        return Max;
    }

后来想明白了，原来题这么简单！！！！！！只需要判断两字符串是否相等，如果相等就返回-1，不相等就返回较长的字符串长度！

特别注意：

Trivially, any string is a subsequence of itself and an empty string is a subsequence of any string.
任何字符串本身都是一个子序列，空字符串是任何字符串的子序列。

正确代码如下：

#include <iostream>
#include <string>
using namespace std;
class Solution {
public:
    int findLUSlength1(string a, string b) {
        int a_length = a.length();
        int b_length = b.length();
        if(a == b)
            return -1;
        else
            return a_length>b_length ? a_length : b_length;
    }
};
int main()
{
    Solution A;
    string a, b;
    cin >> a >> b;
    cout << A.findLUSlength(a, b) << endl;
    return 0;
}

以后得好好理解题意才能做题，否则只会浪费时间。