[leetcode]521. Longest Uncommon Subsequence I

最新推荐文章于 2021-11-30 23:25:33 发布

原创最新推荐文章于 2021-11-30 23:25:33 发布 · 346 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

473 篇文章

订阅专栏

其它（重要）

168 篇文章

订阅专栏

本文探讨了LeetCode上的一道题目：寻找两个字符串中的最长不同子序列，并提供了一种简洁高效的解决方案。通过对比字符串长度及内容，快速得出结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

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.

思路：

两个字符串中最长的字符串是否为另一字符串的子字符串，如果是，返回最长字符串长度；否则返回-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;
    }
};