LeetCode: 210. Course Schedule II

版权声明：本文由博主@杨领well发表在http://blog.csdn.net/yanglingwell，如果转载请注明出处。 https://blog.csdn.net/yanglingwell/article/details/82834131

LeetCode: 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.

Example 1:

Input: 2, [[1,0]] 
Output: [0,1]
Explanation: 
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] .

Example 2:

Input: 4, [[1,0],[2,0],[3,1],[3,2]]
Output: [0,1,2,3] or [0,2,1,3]
Explanation: 
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: 207. Course Schedule 题解。需要记录求解过程，求解过程的序列即待求的序列。

AC 代码

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
        unordered_set<int> travelVertices;
        multimap<int, int> adjVer; // 邻接矩阵
        bool hasNewVer = true;
        vector<int> order;
        for(auto iter = prerequisites.begin(); iter != prerequisites.end(); ++iter)
        {
            adjVer.insert({iter->first, iter->second});
        }
        
        while(travelVertices.size() != numCourses && hasNewVer)
        {
            // 记录每个课程的入度
            vector<int> courses(numCourses, 0);
            
            for(size_t i = 0; i < numCourses; ++i)
            {
                for(auto iter = adjVer.find(i); iter != adjVer.end() && iter->first == i; ++iter)
                {
                    if(travelVertices.find(iter->second) == travelVertices.end()) 
                    {
                    	++courses[iter->first];
                   }
                }
            }
            hasNewVer = false;
            for(size_t i = 0; i < courses.size(); ++i)
            {
                // 入度是 0 的课程可以上
                if(courses[i] == 0 && travelVertices.find(i) == travelVertices.end())
                {
                    travelVertices.insert(i);
                    order.push_back(i);
                    hasNewVer = true;
                }
            }
        }
        
        
        if(travelVertices.size() != numCourses)
        {
            return {};
        }
        else
        {
            return order;
        }
    }
};