Leetcode 269. Alien Dictionary

There is a new alien language which uses the latin alphabet. However, the order among letters are unknown to you. You receive a list of words from the dictionary, wherewords are sorted lexicographically by the rules of this new language.Derive the order of letters in this language.

For example,
Given the following words in dictionary,

[
  "wrt",
  "wrf",
  "er",
  "ett",
  "rftt"
]

The correct order is: "wertf".

Note:

1. You may assume all letters are in lowercase.
2. If the order is invalid, return an empty string.
3. There may be multiple valid order of letters, return any one of them is fine.

题解：拓扑排序。不过题目中对合法性检查是不存在环即可。有的字符之间无法比较也可以！

class Solution {
public:
    string alienOrder(vector<string>& words) {
        int len=words.size();
        if(len==0) return "";
        if(len==1) return words[0];
        vector<int> inDegree(26,0);
        vector<vector<int>> edge(26,vector<int>());
        for(int i=0;i<len-1;i++) {
            bool f=true;
            solve(words[i],words[i+1],inDegree,edge,f);
            if(!f) return "";
        }
        int flag[26];
        memset(flag,0,sizeof(flag));
        queue<int> Queue;
        for(int i=0;i<len;i++) {
            for(char c:words[i]) {
                flag[c-'a']++;
            }
        }
        for(int i=0;i<26;i++) {
            if(flag[i]>0) {
                if(inDegree[i]==0) {
                        /*
                    if(Queue.size()>0) {
                        return "";
                    }
                    else {
                        Queue.push(i);
                    }*/
                    Queue.push(i);
                }
            }
        }
        string res="";
        while(!Queue.empty()) {
            int cur=Queue.front();
            res+=(char)(cur+'a');
            Queue.pop();
            //int count=0;
            for(int i=0;i<edge[cur].size();i++) {
                int nex=edge[cur][i];
                inDegree[nex]--;
                if(inDegree[nex]==0) {
                    //count++;
                    Queue.push(nex);
                    //if(count>1) return "";
                }
            }
            //if(edge[cur].size()>0&&count==0) return "";
        }
        for(int i=0;i<26;i++) {
            if(flag[i]>0) {
                if(inDegree[i]!=0) return "";
            }
        }
        return res;
    }

    void solve(string& a,string& b,vector<int>& inDegree,vector<vector<int>>& edge,bool& f) {
        int l=0,r=0;
        while(l<(int)a.size()&&r<(int)b.size()) {
            if(a[l]!=b[r]) {
                edge[a[l]-'a'].push_back(b[r]-'a');
                inDegree[b[r]-'a']++;
                f=true;
                return;
            }
            l++;
            r++;
        }
        if(a.size()>b.size()) f=false;
    }
};