LeetCode - 207/210 - Course Schedule

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.

题意：有n门课程，有的课程需要先行课，[x, y]表示y是x的先行课。问能否完成所有课程。

dfs，搜索一门课的所有先行课，看会不会成环，成环则不能。vis表示这门课是否判断过了，cur是判断成环过程中使用的标记。

class Solution {
public:
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<unordered_set<int> > graph(numCourses);
        for (auto pre: prerequisites)
            graph[pre.second].insert(pre.first);
        
        vector<bool> vis(numCourses, false), cur(numCourses, false);
        for (int i = 0; i < numCourses; ++i) {
            if (vis[i]) continue;
            if (dfs(graph, vis, cur, i)) return false;
        }
        return true;
    }
    bool dfs(vector<unordered_set<int> >& graph, vector<bool>& vis, vector<bool>& cur, int x) {
        if (vis[x]) return false;
        vis[x] = cur[x] = true;
        for (int num: graph[x]) {
            if (cur[num] || dfs(graph, vis, cur, num))
                return true;
        }
        cur[x] = false;
        return false;
    }
};

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

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.

在上一题的基础上，输出上课的顺序。

然后我才发现，这题是图的深度优先遍历+拓扑排序。还没有研究过拓扑排序，不过这种做法是拓扑排序的一种经典做法，最终将ans倒序输出就是答案。最开始一直不理解为什么要倒序，大胆推测了一下，可能是因为有向边的顺序问题？先放着，有时间了去看下拓扑排序。

class Solution {
public:
    vector<int> ans;
    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<unordered_set<int> > graph(numCourses);
        for (auto pre: prerequisites)
            graph[pre.second].insert(pre.first);
        
        vector<bool> vis(numCourses, false), cur(numCourses, false);
        for (int i = 0; i < numCourses; ++i) {
            if (vis[i]) continue;
            if (dfs(graph, vis, cur, i)) 
                return {};
        }
        reverse(ans.begin(), ans.end());
        return ans;
    }
    bool dfs(vector<unordered_set<int>>& graph, vector<bool>& vis, vector<bool>& cur, int x) {
        if (vis[x]) return false;
        cur[x] = vis[x] = true;
        for (auto num: graph[x]) {
            if (cur[num] || dfs(graph, vis, cur, num))
                return true;
        }
        cur[x] = false;
        ans.push_back(x);
        return false;
    }
};