521. Longest Uncommon Subsequence I

最新推荐文章于 2025-01-04 07:15:00 发布

最新推荐文章于 2025-01-04 07:15:00 发布 · 181 阅读

Leetcode 专栏收录该内容

108 篇文章

订阅专栏

本文介绍了一道LeetCode题目——寻找两个字符串间的最长不同子序列，并提供了一个简洁高效的解决方案。该题要求找出两个字符串中独有的最长子序列，通过比较两字符串是否相同来快速得出答案。

题目描述【Leetcode】

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.

这道题说了很多，其实很简单，就判断a与b是否相等，相等返回-1，不相等就返回a与b长度最长的那个

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