主要能保证所有路的终点都是同一个,并且无环(visited)
尝试所有情况,并回溯
public class test {
public boolean leadsToDestination(int n, List<List<Integer>> list, int source, int target){
boolean[] visit = new boolean[n];
List<List<Integer>> m = new ArrayList<>();
for(int i=0; i<n; i++){
m.add(new ArrayList<>());
}
for(int i=0; i<list.size(); i++){
List<Integer> tmp = list.get(i);
m.get(tmp.get(0)).add(tmp.get(1));
}
if(m.get(target).size() == 0){
return false;
}
return dfs(m, visit, source, target);
}
public boolean dfs(List<List<Integer>> m, boolean[] visit, int source, int target){
if(m.get(source).size()==0 && source != target){
return false;
}
List<Integer> tmp = m.get(source);
for(int i=0; i< tmp.size(); i++){
int cur = tmp.get(i);
if(visit[cur]){ //有环
return false;
}
visit[cur] = true;
if(!dfs(m, visit, cur, target)){
return false;
}
visit[cur] = false;
}
return true;
}
}