210. Course Schedule II

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].

题目大意

前提：有部分课程需要以另一门课程为前提，如果存在两门课互为前提，则该课程信息不可完成；如果不存在，则该课程信息可完成。
输入课程信息，判断该课程信息能否完成。如果可以完成，返回一种可能完成的顺序；如果不可以，返回一个空数组。

解题思路

这是一个拓扑排序问题。
遍历有向图中的节点，每次找到一个入度为0的节点，将其push进队列。然后利用BFS，取队列的头并push入存储数据的数组，然后将其从队列中pop掉，将该节点所指向其他节点的边都去掉（即，将其指向的节点入度减一），如果存在节点入度减一的值为零，则将其push入队列，重复这个过程，直到队列为空。
最后，判断该课程信息能否完成（即，判断数组中的元素个数是否与课程总数相等）。如果可以完成（数组中的元素个数与课程总数相等），返回一种可能完成的顺序；如果不可以，返回一个空数组。

算法复杂度

$O(|V+E|)$

代码实现

class Solution {
public:
  vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
    vector<int> inDegreeMap(numCourses);
    vector<int> order;
    vector<pair<int,int>>::iterator iter;
    // compute the in-degree of all points
    for (iter = prerequisites.begin(); iter != prerequisites.end(); iter++) {
      ++inDegreeMap[iter->first];
    }
    // push back the 0-inDegree point to the queue
    queue<int> que;
    for (int i = 0; i < numCourses; ++i) {
      if (inDegreeMap[i] == 0) { que.push(i); }
    }
    // BFS
    while (!que.empty()) {
      int u = que.front();
      que.pop();
      order.push_back(u);
      for (iter = prerequisites.begin(); iter != prerequisites.end(); iter++) {
        if (u == iter->second) {
          // find the next position of u
          // and determine whether its (in-degree - 1) equals 0
          int uLast = iter->first;
          if (--inDegreeMap[uLast] == 0) {
            que.push(uLast);
          }
        }
      }
    }
    if (order.size() != numCourses) order.clear();
    return order;
  }
};