leetcode [207]Course Schedule

最新推荐文章于 2025-08-23 16:01:06 发布

weixin_30906185

最新推荐文章于 2025-08-23 16:01:06 发布

阅读量50

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构与算法 java

原文链接：http://www.cnblogs.com/xiaobaituyun/p/10769673.html

本文探讨了如何判断在存在先修课程约束的情况下，是否能完成所有课程的问题。通过使用BFS和DFS算法，对有向图进行环检测，来确定课程完成的可能性。提供了详细的Java代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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?

Example 1:

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

Example 2:

Input: 2, [[1,0],[0,1]]
Output: false
Explanation: 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.

Note:

The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
You may assume that there are no duplicate edges in the input prerequisites.

题目大意：

其实就是判断一个有向图中是否存在环，可以使用BFS和DFS做，BFS的效率比DFS要高一些

解法：

java:

BFS解法：

class Solution {
    public boolean canFinish(int numCourses, int[][] prerequisites) {
        //记录有向图图节点之间的关系
        ArrayList[] graph=new ArrayList[numCourses];
        //记录每个节点的入度
        int[] degree=new int[numCourses];
        Queue queue=new LinkedList();
        int count=0;
        
        for (int i=0;i<numCourses;i++) graph[i]=new ArrayList();
        
        for (int i=0;i<prerequisites.length;i++){
            degree[prerequisites[i][1]]++;
            graph[prerequisites[i][0]].add(prerequisites[i][1]);
        }
        
        for (int i=0;i<numCourses;i++){
            if(degree[i]==0){
                ((LinkedList) queue).add(i);
                count++;
            }
        }
        
        while (!queue.isEmpty()){
            int course=(int)((LinkedList) queue).pollFirst();
            for (int i=0;i<graph[course].size();i++){
                int index=(int)graph[course].get(i);
                degree[index]--;
                if (degree[index]==0){
                    ((LinkedList) queue).add(index);
                    count++;
                }
            }
        }
        
        if(count==numCourses) return true;
        else return false;
    }
}

DFS解法;

class Solution {
    public boolean canFinish(int numCourses, int[][] prerequisites) {
        //记录有向图图节点之间的关系
        ArrayList[] graph=new ArrayList[numCourses];
        //记录每个节点是否被访问过
        boolean[] visited=new boolean[numCourses];

        for (int i=0;i<numCourses;i++) graph[i]=new ArrayList();

        for (int i=0;i<prerequisites.length;i++){
            graph[prerequisites[i][0]].add(prerequisites[i][1]);
        }

        for (int i=0;i<numCourses;i++){
            if (!dfs(graph,visited,i)) return false;
        }

        return true;
    }

    private boolean dfs(ArrayList[] graph, boolean[] visited, int course){
        if(visited[course])
            return false;
        else
            visited[course] = true;;

        for(int i=0; i<graph[course].size();i++){
            if(!dfs(graph,visited,(int)graph[course].get(i)))
                return false;
        }
        visited[course] = false;
        return true;
    }
}

转载于:https://www.cnblogs.com/xiaobaituyun/p/10769673.html