关于leetcode上的“课程表”的练习

最新推荐文章于 2024-08-29 09:00:00 发布

LERLOVEING

最新推荐文章于 2024-08-29 09:00:00 发布

阅读量122

点赞数

本文链接：https://blog.csdn.net/m0_46343170/article/details/106219269

版权

代码如下：

class Solution {
public:
	bool dfs(vector<vector<int>> &AdjacencyList,vector<int> &Visit,int numCourses,int Nodenum){
		if( Visit[Nodenum] == 1 )  return false;
		if( Visit[Nodenum] == 2 )  return true;
		Visit[Nodenum] = 1;
		for( int adjNodenum : AdjacencyList[Nodenum] ){
			if( !dfs(AdjacencyList,Visit,numCourses,adjNodenum) )
				return false;
		}
		Visit[Nodenum] = 2;
		
		return true;
	}
    bool canFinish(int numCourses, vector<vector<int>>& prerequisites) {
		vector<vector<int>> AdjacencyList(numCourses);
		for( vector<int> vector_item : prerequisites ){
			AdjacencyList[vector_item[1]].push_back(vector_item[0]);
		}
		vector<int> Visit(numCourses,0);
		for( int i = 0; i < numCourses; ++i ){
			if( !dfs(AdjacencyList,Visit,numCourses,i) )
				return false;
		}
		return true;
    }
};