Course Schedule

最新推荐文章于 2024-11-13 11:26:51 发布

iteye_6051

最新推荐文章于 2024-11-13 11:26:51 发布

阅读量85

点赞数

分类专栏： Leetcode 文章标签：图论

本文链接：https://blog.csdn.net/iteye_6051/article/details/82647595

版权

Leetcode 专栏收录该内容

231 篇文章 1 订阅

订阅专栏

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][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判断图中是否存在环，如果存在环就不能完成课程。代码如下：


public class Solution {
    boolean[] onStack;
    boolean[] isVisited;
    public boolean canFinish(int numCourses, int[][] prerequisites) {
        if(prerequisites == null || prerequisites.length == 0) return true;
        List<Integer>[] graph = new List[numCourses];
        onStack = new boolean[numCourses];
        isVisited = new boolean[numCourses];
        for(int i = 0; i < prerequisites.length; i++) {
            int key = prerequisites[i][1];
            int value = prerequisites[i][0];
            if(graph[key] == null) graph[key] = new ArrayList<Integer>();
            graph[key].add(value);
        }
        for(int i = 0; i < numCourses; i++) {
            if(isVisited[i] == false && hasCycle(i, graph) == true) 
                return false;
        }
        return true;
    }

    public boolean hasCycle(int i, List<Integer>[] graph) {
        boolean cycle = false;
        onStack[i] = true;
        isVisited[i] = true;
        if(graph[i] != null) {
            for(int j : graph[i]) {
                if(isVisited[j] == false) {
                    cycle = hasCycle(j, graph);
                    if(cycle == true) 
                        break;
                } else if(onStack[j] == true) {
                    cycle = true;
                    break;
                }
            }
        }
        onStack[i] = false;
        return cycle;
    }
}