LeetCode专题----DFS

207. Course Schedule

There are a total of n courses you have to take, labeled from 0 to n - 1.

Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1]

Given the total number of courses and a list of prerequisite pairs, is it possible for you to finish all courses?

For example:

2, [[1,0]]
There are a total of 2 courses to take. To take course 1 you should have finished course 0. So it is possible.

2, [[1,0],[0,1]]
There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.

思路：转换成邻接表。利用DFS判断一个有向图是否有环的思路是：对一个节点v进行深度遍历，判断是否能从v到达自己这个节点，即是否存在从v到v的环路。 在图的深度遍历中，我们将图中每个节点设置为三个状态：-1,0,1，分别表示还没发现的节点；已经发现但是还没处理完的节点；已经处理完的节点。对应上述思路，假设我们正在处理v，那么v的状态为0，其余正在处理节点的状态也为0，如果从状态为0的节点遍历到状态为0的节点就存在环。

public class Solution {
    public boolean canFinish(int numCourses, int[][] prerequisites) {
        List<List<Integer>> adjList = new ArrayList<>();

        int[] isVisited = new int[numCourses];
        for(int i=0; i<numCourses; i++) {
            adjList.add(new ArrayList<Integer>());
            isVisited[i] = -1;
        }
        for(int i=0; i<prerequisites.length; i++) {
            adjList.get(prerequisites[i][1]).add(prerequisites[i][0]);
        }
        for(int i=0; i<numCourses; i++) {
            if(!dfs(adjList, isVisited, i))
                return false;
        }

        return true;
    }

    private boolean dfs(List<List<Integer>> adjList, int[] isVisited, int courseNum) {
        if(isVisited[courseNum] == 0)
            return false;
        else if(isVisited[courseNum] == -1)
            isVisited[courseNum] = 0;

        for(Integer i : adjList.get(courseNum)) {
            if(isVisited[i] == -1) {
                if(!dfs(adjList, isVisited, i)) 
                    return false;
            }
            else if(isVisited[i] == 0) {
                return false;
            }
        }
        isVisited[courseNum] = 1;
        return true;
    }
}