LeetCode-Course Schedule-解题报告

原创 2015年07月08日 18:09:44

原题链接 https://leetcode.com/problems/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, is it possible for you to finish all courses?

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 it is possible.

2, [[1,0],[0,1]]

There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.


其实就是拓扑排序。


我使用的dfs,当然我用一个数组保存了每个节点的入度。每次输出入度为0的节点。


class Solution {
public:
    bool canFinish(int numCourses, vector<pair<int, int>>& prerequisites) {
        vector<vector<int> >graph(numCourses);
		vector<int>out(numCourses, 0);
	    int num = 0;
		vector<bool>vis(numCourses, 0);
		for (auto &p : prerequisites)
			graph[p.second].push_back(p.first), out[p.first]++;
		dfs(graph, num, vis, out);
		return num == numCourses;
	}
	void dfs(vector<vector<int> >& g, int& num, vector<bool>& vis, vector<int>& out)
	{
		if (num == g.size())return;
		for (int i = 0; i < g.size(); ++i)
		{
			if (!vis[i] && out[i] == 0)
			{
				num++;
				vis[i] = true;
				for (int j = 0; j < g[i].size(); ++j)
					--out[g[i][j]];
				dfs(g, num, vis, out);
			}
		}
	}
};


版权声明:

相关文章推荐

[leetcode] 210. Course Schedule II 解题报告

题目链接:https://leetcode.com/problems/course-schedule-ii/ There are a total of n courses you have to ...

[Leetcode] 207. Course Schedule 解题报告

题目: There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may h...

[LeetCode]Course Schedule,解题报告

题目There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have pre...

【LeetCode】Course Schedule 解题报告

【题目】 There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may ...

LeetCode-Course Schedule-解题报告

原题链接 https://leetcode.com/problems/course-schedule/ There are a total of n courses you have to ta...

poj 1325Machine Schedule解题报告-最小顶点覆盖等于最大匹配数

题目链接:http://poj.org/problem?id=1325 题目描述:2台机器A和B,分别有n,m种工作状态,k个工作,可以在A机器x状态下工作,也可以在B机器y状态下工作。问最少切换多...

LA-2523 & POJ-1325 & HDOJ-1150 Machine Schedule 解题报告

二分图求最小点集覆盖题。题意:

leetCode解题报告5道题(三)

5道题目分别是:【Binary Tree Zigzag Level Order Traversal】、【Convert Sorted Array to Binary Search Tree和Conve...

[leetcode] 96. Unique Binary Search Trees 解题报告

题目链接:https://leetcode.com/problems/unique-binary-search-trees/ Given n, how many structurally uniq...

Leetcode Big Manipulation 解题报告

第一部分leetcode136. Single Number中等难度题意,给一个整数数组,数组中除了一个元素只有一个,其余元素都有两个,求这个只出现一次的元素。要求时间复杂度为O(n),空间复杂度为O...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)