leetcode 522. Longest Uncommon Subsequence II 最长非公共子序列 + 暴力寻找子串

今天药忘吃喽~ 2022-06-03 03:16 180阅读 0赞

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\].

和上一道题一样，这次加大了难度，**遍历所有的字符串，对于每个遍历到的字符串，再和所有的其他的字符串比较，看是不是某一个字符串的子序列，如果都不是的话，那么当前字符串就是一个非共同子序列，用其长度来更新结果res**，

建议和这一道题一起学习[leetcode 521. Longest Uncommon Subsequence I 最初非公共子序列][leetcode 521. Longest Uncommon Subsequence I]

代码如下：

#include <iostream>
    #include <vector>
    #include <map>
    #include <set>
    #include <queue>
    #include <stack>
    #include <string>
    #include <climits>
    #include <algorithm>
    #include <sstream>
    #include <functional>
    #include <bitset>
    #include <numeric>
    #include <cmath>
    
    using namespace std;
    
    class Solution 
    {
    public:
        int findLUSlength(vector<string>& strs) 
        {
            int res = -1;
            for (int i = 0; i < strs.size(); i++)
            {
                int j = 0;
                for (j = 0; j < strs.size(); j++)
                {
                    if (i == j)
                        continue;
                    if (check(strs[i], strs[j]) == true)
                        break;
                }
                if(j==strs.size())
                    res = max(res, (int)strs[i].length());
            }
            return res;
        }
    
        bool check(string sub, string tar)
        {
            int i = 0;
            for (char c : tar)
            {
                if (c == sub[i])
                    i++;
                if (i == sub.length())
                    break;
            }
            return i == sub.length();
        }
    };

[leetcode 521. Longest Uncommon Subsequence I]: http://blog.csdn.net/jackzhang_123/article/details/78820881