Easy-16

最新推荐文章于 2024-07-25 14:57:23 发布

Lancher_Mo

最新推荐文章于 2024-07-25 14:57:23 发布

阅读量311

点赞数

分类专栏： Lancher's re-code life 文章标签： leetcode

本文链接：https://blog.csdn.net/Lancher_Mo/article/details/71156069

版权

Lancher's re-code life 专栏收录该内容

49 篇文章 0 订阅

订阅专栏

leetcode 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.
Only letters from a ~ z will appear in input strings.

AC:

int findLUSlength(char* a, char* b) {
    int len1=strlen(a);
    int len2=strlen(b);
    if(len1!=len2)
    {
        return len1>len2?len1:len2;
    }
    if(strstr(a,b)==NULL)
    {
        return len1;
    }else
    {

        return -1;
    }
}