leetcode练习 Course Schedule II

最新推荐文章于 2023-04-09 00:43:14 发布

那个字念颀

最新推荐文章于 2023-04-09 00:43:14 发布

阅读量160

点赞数

分类专栏：学习文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_38351756/article/details/78453873

版权

学习专栏收录该内容

33 篇文章 0 订阅

订阅专栏

之前做了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, 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:
The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
You may assume that there are no duplicate edges in the input prerequisites.

再上个代码

class Solution {
public:
    vector<int> findOrder(int numCourses, vector<pair<int, int>>& prerequisites) {
        int grap[numCourses]={0};
      vector<int> order;
      for (int i=0;i<prerequisites.size();i++)
          grap[prerequisites[i].first]++;
      for (int j=numCourses-1;j>=0;--j)
      {
          int del=-1;
         for (int k=0;k<numCourses;k++)
         {
             if (grap[k]==0)
             {
                 del=k;
                 grap[k]=-1;
                 order.push_back(k);
                 break;
             }
         }
         if(del==-1)
         {
             order.clear();
             return order;
         }
         for (int i=0;i<prerequisites.size();i++)
         {
             if (prerequisites[i].second==del)
                 grap[prerequisites[i].first]--;
         }
     }
     return order;
    }
};