Skip to content

Commit e4adae0

Browse files
committedMar 21, 2020
Add the corresponding link to each LeetCode problem
1 parent 3287b4e commit e4adae0

File tree

510 files changed

+1530
-0
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

510 files changed

+1530
-0
lines changed
 

‎BFS/1036.Escape-a-Large-Maze/Readme.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -11,3 +11,6 @@
1111
所以这是一个BFS题,只要从一个点出发开始发散,当visited的网格数目(也就是覆盖的面积)大于2500的时候,就说明这个点并没有被封闭。
1212

1313
有了这个基本思路后,我们需要注意,其实200的周长最大能封闭的面积可以是19900,而不是2500.原因是这200个点可以以45度倾斜地围住一个角。因此```0+1+2+...+199 = 19900```才是最大的封闭面积。只有发散的区域超过了这个面积,才能保证不被封闭。
14+
15+
16+
[Leetcode Link](https://leetcode.com/problems/escape-a-large-maze)

‎BFS/126.Word-Ladder-II/Readme.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -22,3 +22,6 @@ while (!q.empty())
2222
要保证一个for循环完整地执行完.
2323

2424
4.要找到回溯的路径,就需要保存所有单词的prev.因为可能有多条最短路径都经过str,那么str的prev需要是一个集合.最后回溯的方法用DFS.
25+
26+
27+
[Leetcode Link](https://leetcode.com/problems/word-ladder-ii)

0 commit comments

Comments
 (0)
Please sign in to comment.