521. Longest Uncommon Subsequence I

最新推荐文章于 2024-07-24 14:54:00 发布

huangjw47

最新推荐文章于 2024-07-24 14:54:00 发布

阅读量1.3k

点赞数 1

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/woshihuangjianwei/article/details/69788926

版权

leetcode 专栏收录该内容

114 篇文章 0 订阅

订阅专栏

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.

题目链接：https://leetcode.com/problems/longest-uncommon-subsequence-i/#/description

题目大意：两个字符串中最长的字符串是否为另一字符串的子字符串，如果是，则返回-1，否则返回最长字符串长度。

思路：比较两个字符串的长度，若不相等，则返回长度的较大值，若相等则再判断两个字符串是否相同，若相同则返回-1，否则返回长度。

参考代码：

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