【算法】【Graph】Course Schedule

Difficulty: Medium

Description

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.

Solution

思路

将所有的课程构成一个有向图，只要图中构成环，就不能完成该系列的课程。

用dfs遍历该图。若访问的该节点出现在已访问过节点的集合中，说明这是环。

用isCircle数组记录被访问过的节点：每访问一个节点i，isCircle[i] = true，每从一个节点i回退，isCircle[i] = false。

代码

通过leetcode测试

class Solution {
public:
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
        visited.resize(numCourses);
        for (int i = 0; i < numCourses; ++i) visited[i] = false;

        course.resize(numCourses);
        for (auto pre : prerequisites) {
            course[pre.second].push_back(pre.first);
        }

        for (int i = 0; i < numCourses; ++i) {
            if (!visited[i]) {
                vector<bool> isCircle(numCourses, false);  // 检查访问的该dfs路径是否有回环
                if (!dfs(i, isCircle)) return false;
            }
        }
        return true;
    }

    bool dfs(int src, vector<bool>& isCircle) {
        visited[src] = true;
        isCircle[src] = true;

        for (int i = 0; i < course[src].size(); ++i) {
            if (isCircle[course[src][i]]) return false;
            bool finish = dfs(course[src][i], isCircle);
            if (!finish) return false;
        }
        isCircle[src] = false;
        return true;
    }

private:
    vector<bool> visited;    // 记录节点是否被访问过，被访问过的无需再访问
    vector<vector<int>> course;            // 构造邻接链表
};