Commit 216f073

author

Joseph Luce

authored

Update 1091_shortest_path_in_binary_matrix.md

1 parent 2c0e21c commit 216f073Copy full SHA for 216f073

File tree

-1

lines changed

-1

lines changed

Lines changed: 0 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -54,7 +54,6 @@ class Solution:`
`54`	`54`	`We can further improve the run-time of the BFS by using a bi-directional BFS.`
`55`	`55`	`If you imagine a circle, every time you expand the circle, the number of neighbors being visited almost doubles.`
`56`	`56`	`Now if you used two circles and expanded them both simultaneously, when they touch, it would have visited less neighbors compared to using one circle.`
`57`		`-This decreases the run-time for some inputs, worst case, is the same as the first BFS solution.`
`58`	`57`
`59`	`58`	```
`60`	`59`	`from collections import deque`

Comments

(0)