[LeetCode] 207 Course Schedule_Medium tag: BFS, DFS
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?
Example 1:
Input: 2, [[1,0]]
Output: true
Explanation: There are a total of 2 courses to take.
To take course 1 you should have finished course 0. So it is possible.
Example 2:
Input: 2, [[1,0],[0,1]]
Output: false
Explanation: 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.
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.
我的理解是这个题就是问, 如果有两门课互为prerequisite课, 那么就False, 否则True, 注意的是这里的互为有可能是中间隔了几门课, 而不是直接的prerequisite, 例如: [(0,1),(2,0),(1,2)], 这里 1 是0 的前置课, 0 是2 的前置课, 所以1是2 的间接前置课, 但是最后一个input说2 是1 的前置课, 所以就矛盾, 不可能完成, return False. 所以思路为, 建一个dictionary, 分别将input 的每个pair(c1, c2)放入dictionary里面, 前置课(c2)为key, 后置课(c1)为value, 不过放入之前要用bfs 判断c1 是否为c2 的前置课, 如果是, 那么矛盾, return False. 否则一直判断到最后的pair, 返回Ture.
12/05/2019 Update: 这个题目实际上是有向图里面找是否有环的问题。用dfs去遍历每个graph的点,可以参考Directed Graph Loop detection and if not have, path to print all path. T: O(n) S: O(n)
1. Constraints:
1) 实际这里的n对我这个做法没有什么用处, 因为课程id 是unique的.
2. Ideas
BFS: T: O(n) number of nodes, S: O(n^2)
1) init dictionary, d
2) for pair(c1,c2) in prerequisites, use bfs to see if c1 is a prerequisity of c2, if so , return False, else, d[c2].add(c1), and until all pairs been checked. return True
3) bfs: use queue and visited to check whether there is a path from source to target.
3. Code
class Solution:
def courseSchedule(self, numCourse, prerequisites):
def bfs(d, source, target):
if source not in d: return False
queue, visited = collections.deque([source]), set([source])
while queue:
node = queue.popleft()
if node == target: return True
for each in d[node]:
if each not in visited:
queue.append(each)
visited.add(each)
return False d = collections.defaultdict(set)
for c1, c2 in prerequisites:
if bfs(d,c1, c2): return False
d[c2].add(c1)
return True
4. Test cases:
1) [(0,1),(2,0),(1,2)], => False
最新文章
- iOS - 如何切图适配各种机型
- 深入C#中get与set的详解(转)
- wall 和panel有啥区别
- 删除sqlserver2008登录记录
- 设计模式_Iterator_迭代器模式
- windows蓝屏代码大全及常见蓝屏解决方案
- 自己实现的库函数2(memset,memcmp,memcpy,memmove)
- 简单了解View是What?
- java.text.NumberFormat使用方法
- openfire数据库中文乱码问题
- 一行命令更新所有 npm 依赖包
- Hadoop 集群安装(从节点安装配置)
- appium---android元素定位
- Day032--Python--操作系统, process进程
- 类Shiro权限校验框架的设计和实现
- postgresql主从配置
- JAVA Eclipse如何导入已有的项目
- inotify工具安装配置
- Jenkins在CentOS中的安装
- TBluetoothLEDevice.UpdateOnReconnect