力扣：面试题17.15.最长单词（Longest Word LCCI）（C++）

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <unordered_set>
using namespace std;

class Solution {
public:
    string longestWord(vector<string>& words) {

        unordered_set<string>unordered_set1(words.begin(),words.end());
        int word_length,max_length=0;
        vector<string>max_word;
        string word;
        for (int i = 0; i < words.size(); ++i) {
            word=words[i];
            word_length=word.size();
            unordered_set1.erase(word);
            for (int j = 0; j < word_length; ++j) {
                if (this->isCombinated(word,unordered_set1)){
                    max_word.push_back(word);
                    if (word.size()>max_length)max_length=word.size();
                    unordered_set1.insert(word);
                    break;
                }
            }
            unordered_set1.insert(word);
        }
        if (max_word.size()==0)return "";
        else if (max_word.size()==1)return max_word[0];
        else{
            sort(max_word.begin(),max_word.end());
            vector<string>v2;
            for (int i = 0; i < max_word.size(); ++i) {
                if (max_word[i].size()==max_length)return max_word[i];
            }
        }
        return "";
    }

private:
    bool isCombinated(string s,unordered_set<string>& words)
    {
        if (s.size() == 0)return true;
        for(int i=1;i<=s.size();i++)
        {
            if (words.count(s.substr(0, i)) && isCombinated(s.substr(i), words))return true;
        }
        return false;
    }

};

int main() {
    Solution s;
    string ss;
    vector<string> v1={"llllcccl","clclll","ccc","llccllccl","lcclccclcl","c"};
    vector<string> v2={"cat","banana","dog","nana","walk","walker","dogwalker"};
    vector<string> v3={""};
    ss=s.longestWord(v1);
    cout<<ss<<endl;
    ss=s.longestWord(v2);
    cout<<ss<<endl;
    ss=s.longestWord(v3);
    cout<<ss<<endl;
    return 0;
}