521. Longest Uncommon Subsequence I（python+cpp）

题目：

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.
解释：
寻找两个字符串的最长非公共subsequence，注意，subquence是某个字符串的subsequence即可。

对于两个字符串A和B,当len(A)>len(B)时，那么最长的可能的subsequence是A，并没有B的subsequence可以等于A，所以答案是：len(A)
当len(A)==len(B)时，唯一与A相等的subsequence就是B，所以答案还是len(A)
只有当A==B时，A的任何subsequence都可以在B中找到，所以但是是-1。

python代码：

class Solution(object):
    def findLUSlength(self, a, b):
        """
        :type a: str
        :type b: str
        :rtype: int
        """
        return -1 if a==b else max(len(a),len(b))

c++代码：

#include <math>
class Solution {
public:
    int findLUSlength(string a, string b) {
        return a==b?-1:max(a.size(),b.size());  
    }
};

总结
c++中问号表达式居然比自己写if要快。