GoLang Solution For LeetCode Problem: Course Schedule II
Solving Course Schedule II in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
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.
Input: 2, [[1,0]] Output: [0,1] Explanation: 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] .
Input: 4, [[1,0],[2,0],[3,1],[3,2]] Output: [0,1,2,3] or [0,2,1,3] Explanation: 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] .
- You may assume that there are no duplicate edges in the input prerequisites.
See the full details of the problem Course Schedule II at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go