-
Notifications
You must be signed in to change notification settings - Fork 0
/
Graph-Alien Dictionary
59 lines (53 loc) · 1.56 KB
/
Graph-Alien Dictionary
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#include<vector>
#include<iostream>
using namespace std;
class Solution{
public:
vector<int> topoSort(int V , vector<int> adj){
int indegree[V]={0};
for(int i=0;i<V;i++){
for(auto it : adj[i]){
indegree[it]++;
}
}
queue<int> q;
for(int i=0;i<V;i++){
if(indegree[i]==0){
q.push(i);
}
}
vector<int> topo;
while(!q.empty()){
int node = q.front();
q.pop();
topo.push_back(node);
for(auto it : adj[node]){
indegree[it]--;
if(indegree[it]==0){
q.push_back(it);
}
}
}
return topo;
}
string findOrder(string dict[] , int N , int K){
vector<int> adj[K];
for(int i=0;i<N-1;i++){
string s1=dict[i];
string s2=dict[i+1];
int len=min(s1.size() , s2.size());
for(int ptr = 0;ptr<len;ptr++){
if(s1[ptr]!=s2[ptr]){
adj[s1[ptr]-'a'].push_back(s2[ptr]-'a');
break;
}
}
}
vector<int> topo=topoSort(K,adj);
string ans="";
for(auto it : topo){
ans=ans+char(it+'a');
}
return ans;
}
}