[Leetcode] 521. Longest Uncommon Subsequence I 解题报告-优快云博客

本文链接：https://blog.youkuaiyun.com/magicbean2/article/details/78757537

本文探讨了如何找出两个字符串中的最长不同子序列，并提供了一种简洁高效的解决方案。通过比较两个输入字符串，若两者不同，则返回长度较长的字符串长度作为最长不同子序列的长度；若相同，则返回-1。

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

题目：

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.

思路：

看了下面的代码，估计很多人都觉得这是一道坑爹的题目。不要把Google的面试想的太高大上，它有时候也会开一下你的玩笑~

代码：

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