Commit 655a513

authored

841 python3 add BFS solution.md

1 parent f3d836d commit 655a513Copy full SHA for 655a513

File tree

+26

-1

lines changed

+26

-1

lines changed

Lines changed: 26 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -324,7 +324,7 @@ class Solution {`
`324`	`324`	`### python3`
`325`	`325`
`326`	`326`	```python
`327`		`-`
	`327`	`+# 深度搜索优先`
`328`	`328`	`class Solution:`
`329`	`329`	`def dfs(self, key: int, rooms: List[List[int]] , visited : List[bool] ) :`
`330`	`330`	`if visited[key] :`
`@@ -346,6 +346,31 @@ class Solution:`
`346`	`346`	`return False`
`347`	`347`	`return True`
`348`	`348`
	`349`	`+# 广度搜索优先`
	`350`	`+class Solution:`
	`351`	`+ def canVisitAllRooms(self, rooms: List[List[int]]) -> bool:`
	`352`	`+ visited = [False] * len(rooms)`
	`353`	`+ self.bfs(rooms, 0, visited)`
	`354`	`+`
	`355`	`+ for room in visited:`
	`356`	`+ if room == False:`
	`357`	`+ return False`
	`358`	`+`
	`359`	`+ return True`
	`360`	`+`
	`361`	`+ def bfs(self, rooms, index, visited):`
	`362`	`+ q = collections.deque()`
	`363`	`+ q.append(index)`
	`364`	`+`
	`365`	`+ visited[0] = True`
	`366`	`+`
	`367`	`+ while len(q) != 0:`
	`368`	`+ index = q.popleft()`
	`369`	`+ for nextIndex in rooms[index]:`
	`370`	`+ if visited[nextIndex] == False:`
	`371`	`+ q.append(nextIndex)`
	`372`	`+ visited[nextIndex] = True`
	`373`	`+`
`349`	`374`	```
`350`	`375`
`351`	`376`

Comments

(0)