每周LeetCode算法题(二十)210. Course Schedule II
2018-01-20 11:56
316 查看
每周LeetCode算法题(二十)
题目: 210. Course Schedule II
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].
解法分析
本题是一道拓扑排序题,注意从入度着手就好。C++代码
class Solution { public: vector<int> findOrder(int n, vector<pair<int, int>>& edges) { vector< vector<bool> > mat; mat.resize(n); for (int i = 0; i < n; i++) { mat[i].resize(n, 0); } vector<int> id; id.resize(n, 0); for (int i = 0; i < edges.size(); i++) { if (edges[i].first != edges[i].second) { id[edges[i].first]++; } mat[edges[i].second][edges[i].first] = true; } queue<int> q; for (int i = 0; i < n; i++) { if (id[i] == 0) { q.push(i); id[i] = -1; } } vector<int> ans; 4000 vector<int> emp; for (int j = 0; j < n; j++){ if (q.empty()) return emp; int top = q.front(); q.pop(); ans.push_back(top); for (int i = 0; i < n; i++) { if (mat[top][i]) { id[i]--; if (id[i] == 0) { q.push(i); id[i] = -1; } } } } return ans; } };
相关文章推荐
- 每周LeetCode算法题(三):Next Permutation
- LeetCode 210. Course Schedule II
- 每周LeetCode算法题(二):Longest Palindromic Substring
- LeetCode 210. Course Schedule II
- 每周LeetCode算法题(五):416. Partition Equal Subset Sum
- 每周LeetCode算法题(十二): 647. Palindromic Substrings
- 每周LeetCode算法题(六): 617. Merge Two Binary Trees
- LeetCode 210. Course Schedule II
- [LeetCode] 210. Course Schedule II
- [LeetCode] 210. Course Schedule II 课程安排II
- Leetcode 210. Course Schedule II
- 每周LeetCode算法题(四):Merge k Sorted Lists
- 每周LeetCode算法题(十三)152. Maximum Product Subarray
- 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