leetcode之课程表1

题目

题解

深度优先：

思路：前趋节点为当前节点的子节点，叶节点也为可执行节点。通过每通过深度优先遍历一个节点后删除该节点。并用flag标志位确定是否有环，若有环则返回false。

class Solution {

    List<List<Integer>> pre;
    int[] done;
    int flag = 0;

    public boolean canFinish(int numCourses, int[][] prerequisites) {

        pre = new ArrayList<>();

        done = new int[numCourses];

        for (int i = 0; i < numCourses; i++) {
            pre.add(new ArrayList<>());
        }

        for (int[] prerequisite : prerequisites) {
            pre.get(prerequisite[0]).add(prerequisite[1]);
        }
        for (int i = 0; i < numCourses; i++) {
            if (done[i] == 0) {
                dfs(i);
            }
        }
        return flag == 0;
    }

    public void dfs(int courseNum) {

        for (Integer integer : pre.get(courseNum)) {
            if (done[integer] == 0) {
                done[integer] = 1;
                dfs(integer);
            }
            if (done[integer] == 1) {
                flag = 1;
                return;
            }
        }
        done[courseNum] = 2;
    }
}

广度优先（官方）：

通过遍历初始化度数组和后继列表。遍历度为0的节点，并将其后继节点的度减一。再将度为0的节点加入队列。

class Solution {
    List<List<Integer>> edges;
    int[] indeg;

    public boolean canFinish(int numCourses, int[][] prerequisites) {
        edges = new ArrayList<List<Integer>>();
        for (int i = 0; i < numCourses; ++i) {
            edges.add(new ArrayList<Integer>());
        }
        indeg = new int[numCourses];
        for (int[] info : prerequisites) {
            edges.get(info[1]).add(info[0]);
            ++indeg[info[0]];
        }

        Queue<Integer> queue = new LinkedList<Integer>();
        for (int i = 0; i < numCourses; ++i) {
            if (indeg[i] == 0) {
                queue.offer(i);
            }
        }

        int visited = 0;
        while (!queue.isEmpty()) {
            ++visited;
            int u = queue.poll();
            for (int v: edges.get(u)) {
                --indeg[v];
                if (indeg[v] == 0) {
                    queue.offer(v);
                }
            }
        }

        return visited == numCourses;
    }
}