Week5 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

分析

这题目的意思跟前周做的Course Schedule I其实差不多，不过这次题目要我们找出一个修完全部课程的顺序，如果不能修完就返回空。通过题目的意思可以联想到使用拓扑排序的方法来找到拓扑序列，使用最普遍的拓扑排序，即找到一个入度为零的顶点并输出然后删除该点及其出度的所有边，重复以上步骤直至图为空或不存在符合条件的顶点为止。

代码

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<int> result;
        vector<vector<int>> linklist;
        for (int i = 0; i < numCourses; ++i) {
            vector<int> perlinklist;
            linklist.push_back(perlinklist);
        }
        for (int i = 0; i < prerequisites.size(); ++i) {
            linklist[prerequisites[i].second].push_back(prerequisites[i].first);
        }
        int edgenum = prerequisites.size();
        bool visitCourses[2000];
        memset(visitCourses, false, sizeof(visitCourses));
        while (edgenum != 0) {
            int countCourses[2000];
            for (int i = 0; i < numCourses; ++i) countCourses[i] = 0;
            for (int i = 0; i < linklist.size(); ++i) {
                for (int j = 0; j < linklist[i].size(); ++j) {
                    countCourses[linklist[i][j]] += 1;
                }
            }
            int flag = 1;
            for (int i = 0; i < numCourses; ++i) {
                if (countCourses[i] == 0 && visitCourses[i] == false) {
                    result.push_back(i);
                    visitCourses[i] = true;
                    edgenum -= linklist[i].size();
                    linklist[i].clear();
                    flag = 0;
                    break;
                }
            }
            if (flag) {
                result.clear();
                return result;
            }
        }
        for (int i = 0; i < numCourses; ++i) {
            if (visitCourses[i] == false) {
                result.push_back(i);
            }
        }
        return result;
    }
};