Week3 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. Read more about how a graph is represented.
2. You may assume that there are no duplicate edges in the input prerequisites.

分析

这题的背景是关于上课的次序问题，其中有些课程之间可能会存在先后顺序，即先上一门课才能上另一门课，所以如果存在两门课互相存在先后顺序或者多门课依次存在先后顺序的问题的话，那么就不能完成上课了。所以这题是一个判断有向图是否有环的问题，只需要给每个节点设置一个特定的状态，判断存在边两个节点的状态是否一样即可说明有向图中存在环。

代码

int a[2000][2000], visit[2000];
bool is_ascylic;
class Solution {
public:
    void dfs(int sp, int ep) {
        visit[sp] = -1;
        for (int i = 0; i < ep; ++i) {
            if (a[sp][i] == 1 && visit[i] == 0) {
                dfs(i, ep);
                visit[i] = 1;
            }
            if (a[sp][i] == 1 && visit[i] == -1) {
                is_ascylic = true;
                return;
            }
        }
    }
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
        is_ascylic = false;
        set<int> appear_num;
        memset(a, 0, sizeof(a));
        memset(visit, 0, sizeof(visit));
        int len = prerequisites.size();
        for (int i = 0; i < len; ++i) {
            a[prerequisites[i].first][prerequisites[i].second] = 1;
            appear_num.insert(prerequisites[i].first);
        }
        for (int i = 0; i < numCourses; ++i) {
            if (!visit[i]) {
                dfs(i, numCourses);
                visit[i] = 1;
            }
        }
        return !is_ascylic;
    }
};