leetcode题解Java | 210. Course Schedule II
来源:互联网 发布:05后小虎哥称霸网络 编辑:程序博客网 时间:2024/06/06 07:24
题目:https://leetcode.com/problems/course-schedule-ii/#/description
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, return the ordering of courses you should take to finish all courses.
There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.
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 the correct course order is [0,1]
4, [[1,0],[2,0],[3,1],[3,2]]
There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0. So one correct course order is [0,1,2,3]
. Another correct ordering is[0,2,1,3]
.
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.
这道题的本质是考拓扑排序。所以用一个队列来做,每次让入度为零的点入队,出队时,与此点相连的点的入度减一,如果这时这个点的入度也为零了,就入队。做到队列为空为止。
Java实现:
public class Solution { public int[] findOrder(int numCourses, int[][] prerequisites){List<Integer> edges[] = new ArrayList[numCourses];boolean[] visit = new boolean[numCourses];int[] in_degree = new int[numCourses];int[] ans = new int[numCourses];int n=numCourses;for(int i=0; i<numCourses; ++i)edges[i] = new ArrayList<>();for(int i=0; i<prerequisites.length; ++i){int v1 = prerequisites[i][0];int v2 = prerequisites[i][1];edges[v1].add(v2);++in_degree[v2];}Queue<Integer> q = new LinkedList<>();for(int i=0; i<numCourses; ++i)if(in_degree[i] == 0)q.add(i);while(q.isEmpty()!=true){int v = q.poll();visit[v]=true;ans[--n] = v;for(int i:edges[v]){--in_degree[i];if(in_degree[i]==0)q.add(i);}}for(int i=0; i<numCourses; ++i)if(visit[i]==false){ans = new int[0];return ans;}return ans;}}
- leetcode题解Java | 210. Course Schedule II
- LeetCode 210. Course Schedule II 题解
- LeetCode 题解(125): Course Schedule II
- [leetcode] 210.Course Schedule II
- Leetcode 210. Course Schedule II
- 210. Course Schedule II LeetCode
- leetcode 210. Course Schedule II
- LeetCode *** 210. Course Schedule II
- leetcode.210. Course Schedule II
- LeetCode 210. Course Schedule II
- 【LeetCode】210. Course Schedule II
- Leetcode 210. Course Schedule II
- LeetCode 210. Course Schedule II
- Leetcode 210. Course Schedule II
- [LeetCode]210. Course Schedule II
- leetcode 210. Course Schedule II
- LeetCode 210. Course Schedule II
- LeetCode 210. Course Schedule II
- 烧录文件到开发板操作
- 微信指数链接
- 方便的决定前端会员功能-逐浪CMS后台增加会员菜单可配置项
- C语言实现类
- JavaScript 实现内排序算法
- leetcode题解Java | 210. Course Schedule II
- JS获取当前时间
- js实现观察者模式风格替换
- SQL-(6) 数据库备份
- Android Service AIDL的学习,传递对象
- Android day04
- AC自动机
- properties乱码问题
- Hive(笔记)