521. Longest Uncommon Subsequence I(C语言）

这道题感觉没什么意思，求最长的不同的序列，看别人写的答案，就是比较a和b谁长，就是最长的不同的序列，想想没毛病，就是两个序列大小相同时，如果是完全相同的序列，那就输出-1，我就比较了一个第一个数相不相同，如果相同说明后面也有可能有相同的，但是呢，这样输出-1就能ac了 ，我也不想细想了。如果不同没，那a或者b的长度就是最长不同的序列

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: 3Explanation: 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.

int findLUSlength(char* a, char* b) {    int lena=strlen(a);    int lenb=strlen(b);    if(lena>lenb){        return lena;    }else if(lena<lenb){        return lenb;    }else{        if(a[0]==b[0]){            return -1;        }else{            return lena;        }    }    }