LeetCode #207 Course Schedule

题目

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, is it possible for you to finish all courses?

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 it is possible.

2, [[1,0],[0,1]]

There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.

Note:
1. The input prerequisites is a graph represented by a list of edges, not adjacency matrices.
2. You may assume that there are no duplicate edges in the input prerequisites.

解题思路

非常简单的拓扑排序问题，但是要注意一个 pair 中两个顶点的边的方向的确定。比如，[0, 1] 表示的是必须要通过第 1 门课才能选择上第 0 门课，则两个顶点在有向图中的表示应该是 1 $\to$ 0，即顶点 1 的入度为0，顶点 0 的入度为 1，在进入入度为0的点的队列时顶点 1 应该先进入队列，以此表示顶点 1 是当前可以先修的课程。

C++ 代码实现

class Solution {
public:
  bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
    vector<int> degree(numCourses, 0);
    unordered_map<int, vector<int> > graph;
    queue<int> nodes;

    for (int i = 0; i < prerequisites.size(); ++i) {
      degree[prerequisites[i].first]++;
      graph[prerequisites[i].second].push_back(prerequisites[i].first);
    }
    for (int i = 0; i < numCourses; ++i) {
      if (degree[i] == 0) {
        nodes.push(i);
      }
    }

    while (!nodes.empty()) {
      int node = nodes.front();
      nodes.pop();
      degree[node] = -1;
      for (int i = 0; i < graph[node].size(); ++i) {
        degree[graph[node][i]]--;
        if (degree[graph[node][i]] == 0)
          nodes.push(graph[node][i]);
      }
    }

    for (int i = 0; i < numCourses; ++i) {
      if (degree[i] != -1)
        return false;
    }

    return true;
  }
};