[leetcode] 522. Longest Uncommon Subsequence II

最新推荐文章于 2022-08-01 07:03:55 发布

农民小飞侠

最新推荐文章于 2022-08-01 07:03:55 发布

阅读量290

点赞数

CC 4.0 BY-SA版权

分类专栏： C++ leetcode leetcode题解

本文链接：https://blog.youkuaiyun.com/w5688414/article/details/87873226

leetcode题解同时被 3 个专栏收录

903 篇文章

订阅专栏

C++

441 篇文章

订阅专栏

leetcode

284 篇文章

订阅专栏

本文探讨了如何从一组字符串中找出最长的非公共子序列，并提供了一种解决方案。通过遍历字符串列表，检查每个字符串是否为其他字符串的子序列，从而确定最长的非公共子序列。

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

Description

Given a list of strings, you need to find the longest uncommon subsequence among them. 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 a list of 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", "eae"
Output: 3

Note:

All the given strings’ lengths will not exceed 10.
The length of the given list will be in the range of [2, 50].

分析

题目的意思是：找出字符串数组中所有字符串的最长非公共子序列。

如果一个str是其他字符串的公共子集的话，函数就要返回-1；如果不是，那就是非公共子集，我们就找到了一个非公共子序列，我们更新res，来寻找最大的非公共子集。

代码

class Solution {
public:
    int findLUSlength(vector<string>& strs) {
        int n=strs.size();
        int res=-1;
        int i=0;
        int j=0;
        for(int i=0;i<n;i++){
            for(j=0;j<n;j++){
                if(i==j){
                    continue;
                }
                if(isSub(strs[i],strs[j])){
                    break;
                }
            }
            if(j==n){
                res=max(res,(int)strs[i].length());
            }
        }
        return res;
    }
    
    bool isSub(string s1,string s2){
        int i=0;
        for(char c:s2){
            if(c==s1[i]){
                i++;
            }
            if(i==s1.length()) break;
        }
        return i==s1.length();
    }
};