Leetcode522- longest special sequence ii- hash table - String - double pointer

Original link

Note：

Traverse the list , Each time, judge whether the current string is not a substring of other strings , If it is , Record the longest answer , If not , Then it depends on others

The code is as follows ：

class Solution {
    
public:

    bool check(string s1, string s2){
    
        int k = 0;
        for(auto a: s2){
    
            if(s1[k] == a)
                k ++;
        }
        return k == s1.size();
    }

    int findLUSlength(vector<string>& strs) {
    
        int res = -1;
        for(int i = 0; i < strs.size(); i ++){
    
            bool is_sub = false;
            for(int j = 0; j < strs.size(); j ++){
    
                if(i != j && check(strs[i], strs[j])){
    
                    is_sub = true;
                    break;
                }
            }
            if(!is_sub)
                res = max(res, (int)strs[i].size());
        }
        return res;
    }
};