Leetcode-953 Verifying an Alien Dictionary(验证外星语词典)

string ooder;
bool cmp(const string &a,const string &b)
{
    for(int i = 0;i < min(a.size(),b.size());i ++)
    {
        if(a[i]!=b[i])
        {
            for(int j = 0;j < ooder.size();j ++)
            {
                if(ooder[j]==a[i])
                    return 1;
                else if(ooder[j]==b[i])
                    return 0;
            }
        }
    }
    return a.size()<b.size();
}

class Solution
{
    public:
        bool isAlienSorted(vector<string>& words, string order)
        {
            vector<string> words2 = words;
            ooder = order;
            sort(words.begin(),words.end(),cmp);
            for(int i = 0;i < words2.size();i ++)
            {
                if(words[i]!=words2[i])
                    return false;
            }
            return true;
        }
};