leetcode 1408. String Matching in an Array 数组中的字符串匹配-耗时100

Problem: 1408. String Matching in an Array 数组中的字符串匹配

耗时100%，按照长度排序的，然后某个字符串从它后面开始找，若它后面某个字符串包括了这个字符串，就放入结果列表当中，words[j].find(words[i]) != string::npos

Code

class Solution { public: vector<string> stringMatching(vector<string>& words) { int n = words.size(); function<bool(string&, string&)> func = [&](string& a, string& c) ->bool { return a.size() < c.size(); }; sort(words.begin(), words.end(), func); vector<string> ret; for(int i = 0; i < n; i++) { for(int j = i + 1; j < n; j++) { if( words[j].find(words[i]) != string::npos ) { ret.push_back(words[i]); break; } } } return ret; } };