Commit ce47ebc

authored

Create Readme.md

1 parent 2677ece commit ce47ebcCopy full SHA for ce47ebc

File tree

-0

lines changed

-0

lines changed

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,5 @@`
	`1`	`+### 2290.Minimum-Obstacle-Removal-to-Reach-Corner`
	`2`	`+`
	`3`	`+本题的本质就是从起点到终点,采用层级BFS,最少需要穿越几个回合的障碍。而障碍与障碍之间的空气,可以忽略不计。也就是说,某个障碍与空气相邻的话,下一个回合可以通过空气到达其他的障碍。`
	`4`	`+`
	`5`	`+在实现过程中,除了常规的层级BFS之外,我们还需要有一个travelAir的函数。travelAir以某个空格子为起点,遍历所有能"隔空"访问的障碍物。这些障碍物需要加入下一回合BFS的队列中去。`

Comments

(0)