[Leetcode] 522. Longest Uncommon Subsequence II 解题报告

题目

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.

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:

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

思路

思路还是沿着上一道题目的:我们首先对所有的字符串进行排序,不过让长的字符串排在前面。然后依次扫描这些字符串,如果发现一个字符串只出现了一次,并且不是它前面的所有字符串的子序列,那么该字符串的长度就是所有字符串的最长非公共子序列了。

代码

class Solution {
public:
    int findLUSlength(vector<string>& strs) {
        unordered_map<string, int> hash;
        for(int i = 0; i < strs.size(); ++i) {
          ++hash[strs[i]];
        }
        vector<pair<string,int>> v;
        for(auto it = hash.begin(); it != hash.end(); ++it) {
            v.push_back(*it);
        }
        sort(v.begin(), v.end(), PairComp); // longer string comes first
        for(int i = 0; i < v.size(); ++i) {
           if(v[i].second == 1) {
               int j = 0;
               for(; j < i; ++j) {
                   if(isS1subsOfS2(v[i].first, v[j].first))
                     break;
               }
               if(j == i) {
                   return v[i].first.size();
               }
           }
        }
        return -1;
    }
private:
    struct PairCompare {
        bool operator() (pair<string,int> &a, pair<string,int> &b) {
            return a.first.size() > b.first.size();
        }
    } PairComp;
    bool isS1subsOfS2(string &s1, string &s2) {
        int j = 0, i = 0;
        for(; i < s1.size(); ++i) {
            while(j < s2.size() && s1[i] != s2[j]) {
                ++j;
            }
            if(j == s2.size()) {
               return false;
            }
            ++j;
        }
        return true;
    }
};

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值