拓扑排序解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.

题目解析

题目的意思其实跟Course Schedule I 意思差不多，就是给定一对课程0和1，如果pair是[0,1]的话意思是要去上课程0必须要先上课程1，然后这一次题目是让我们找出修完这些课程的顺序(这些顺序可能有很多，但只需返回一个合理的顺序即可)，如果这些课程不能按要求修完，则返回一个空数组

思路分析

这道题其实就是求一个有向图中的拓扑排序。求拓扑排序的方法有很多，这里采用一种比较常见的方法

①从有向图中选择一个 没有前驱（即入度为0）的顶点并输出

②从图中删除该顶点和所有以它为起点的有向边

③重复 1 和 2 直到当前的有向图为空或当前图中不存在无前驱的顶点为止。后一种情况说明有向图中必然存在环

AC代码

#include <iostream>
#include <vector>
#include <string.h>
using namespace std;
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;
    }
};
int main() {
    pair<int,int> t1(1,0);
    pair<int,int> t2(2,0);
    pair<int,int> t3(3,1);
    pair<int,int> t4(3,2);
    vector<pair<int,int>> test;
    test.push_back(t1); test.push_back(t2); test.push_back(t3); test.push_back(t4);
    Solution s;
    vector<int> result = s.findOrder(4, test);
    for (int i = 0; i < result.size(); ++i) {
        cout << result[i] << " ";
    }
    return 0;
}