LeetCode-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:

1. Both strings' lengths will not exceed 100.
2. Only letters from a ~ z will appear in input strings.

翻译：

给定两组字符串，你需要找到这两组字符串的最长的不常见的子序列。最长的不常见的子序列被定义为这个字符串之一并且这个子序列不是  这些字符串中的任何其它一个的子序列。

子序列是一个序列，可以通过删除某些字符而不改变其余元素的顺序从一个序列派生。 平凡地说，任何字符串都是其自身的子序列，空字符串是任何字符串的子序列。

输入两个字符串，并且输出最长的不常见子序列的长度。 如果最长的不常见子序列不存在，则返回-1。

例子 1:

输入: "aba", "cdc"
输出: 3
解释:  最长的不常见子序列是"aba"(或者"cdc"),因为"aba"是"aba"的一个子序列，但不是两组字符串中其它一个的子序列。

注意:

1. 字符串的长度都不超过100。
2. 输入的字符串中只有字母a~z。

思路：

题目简单，直接见代码。

C++代码（Visual Studio 2017）：

#include "stdafx.h"
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;

class Solution {
public:
	int findLUSlength(string a, string b) {
		if (a == b)
			return -1;
		return max(a.size(), b.size());
	}
};

int main()
{
	Solution s;
	string a = "aba";
	string b = "cdc";
	int result=s.findLUSlength(a,b);
	cout << result << endl;
    return 0;
}