Gidhub BE Developer

# LeetCode : 210. Course Schedule II

2021-02-18
goodGid

## 210. Course Schedule II

### Problem

• Need to Retry
``````There are a total of n courses you have to take labelled from 0 to n - 1.
Some courses may have prerequisites, for example, if prerequisites[i] = [ai, bi] this means you must take the course bi before the course ai.
Given the total number of courses numCourses and a list of the prerequisite pairs, return the ordering of courses you should take to finish all courses.
If there are many valid answers, return any of them. If it is impossible to finish all courses, return an empty array.
``````

### Example

``````Input: numCourses = 2, prerequisites = [[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].
``````

### [1] Code (21. 02. 18)

``````class Solution {
public int[] findOrder(int numCourses, int[][] prerequisites) {

for (int i = 0; i < numCourses; i++) {
}

int[] inDegree = new int[numCourses];

for (int i = 0; i < prerequisites.length; i++) {
int prev = prerequisites[i][1];
int next = prerequisites[i][0];
inDegree[next]++;
}

for (int i = 0; i < numCourses; i++) {
if (inDegree[i] == 0) {
queue.offer(i);
}
}

int idx = 0;
int[] ans = new int[numCourses];

while (!queue.isEmpty()) {
Integer top = queue.poll();
ans[idx] = top;
idx++;

for (int i : adjacencyList.get(top)) {
inDegree[i]--;
if (inDegree[i] == 0) {
queue.offer(i);
}
}
}

if (idx != numCourses) {
return new int[] {};
}
return ans;
}
}
``````

Algorithm Description

• 못 풀어서 답을 찾아보았다.

답을 보니 위상 정렬로 풀어야 했다.

이전에도 위상 정렬 문제를 풀었던 적이 있지만 기억이 나지 않았고

개념에 대해 다시 학습하였다.

Review

• 특정 알고리즘을 알아야만 푸는 문제라서

다음에 다시 풀어보도록 하자 !