【第十九周】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.

leetCode地址：https://leetcode.com/problems/course-schedule-ii/description/

解题思路

这道题是上一篇博客 Course Schedule 的进阶版。其区别在于，上一题只需要求出是否能上完所有课程，而这里需要给出一个课程学习序列。

很明显要用到拓扑排序了。上一题我们使用的是DFS求解，而拓扑排序刚好也可以用DFS实现；所以我们只需要在上一题的基础上稍稍修改，获取一个节点的拓扑序即可。

使用DFS完成拓扑排序的思路：经过DFS遍历会产生一个post序列，post[]是这样定义的：当某个节点的所有子节点都已经访问完成时，将其加入post序列。 而拓扑序恰好是post的倒序。

所以我们只需要在上个题目的基础上修改：当某个节点由状态1变为状态2时，将其添加进post[]，全部遍历完成后返回post的倒序即可。

代码

class Solution {
public:
    int visited[10000];
    vector<int> vec;
    int count = 0;

    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
        map<int, vector<int> > graph;
        for (int i = 0; i < numCourses; i++ ) {
            vector<int> temp;
            graph[i] = temp;
        }
        for (int& i : visited) i = 0;
        vec = *new vector<int>();
        for (auto i : prerequisites) {
            graph[i.second].push_back(i.first);
        }

        for (int i = 0; i < numCourses; i++) {
            if (visited[i] == 0) {
                if (!dfs(graph, i)) return *new vector<int>();
            }
        }
        vector<int> ret;
        for (int i = numCourses-1; i >= 0; i--) ret.push_back(vec[i]);
        return ret;
    }
    bool dfs(map<int, vector<int> >& graph, int t) {
        if (visited[t] == 1) return false;
        if (visited[t] == 2) return true;
        visited[t] = 1;
        for (auto i : graph[t]) {
            if (dfs(graph, i) == false) return false;
        }
        visited[t] = 2;
        vec.push_back(t);
        return true;
    }
};

总结

1、拓扑排序
2、DFS