diff --git a/problems/0127.单词接龙.md b/problems/0127.单词接龙.md index b4078913..20ad5182 100644 --- a/problems/0127.单词接龙.md +++ b/problems/0127.单词接龙.md @@ -134,9 +134,8 @@ public int ladderLength(String beginWord, String endWord, List wordList) } ``` -## Java 双向BFS - ```java +// Java 双向BFS class Solution { // 判断单词之间是否之差了一个字母 public boolean isValid(String currentWord, String chooseWord) { diff --git a/problems/0841.钥匙和房间.md b/problems/0841.钥匙和房间.md index 00263cac..faf2b97f 100644 --- a/problems/0841.钥匙和房间.md +++ b/problems/0841.钥匙和房间.md @@ -273,7 +273,9 @@ class Solution { return true; } } +``` +```Java // 广度优先搜索 class Solution { public boolean canVisitAllRooms(List> rooms) { @@ -294,7 +296,9 @@ class Solution { return true; } } +``` +```java // 广度优先遍历(时间优化) class Solution { public boolean canVisitAllRooms(List> rooms) { @@ -459,4 +463,3 @@ function canVisitAllRooms(rooms: number[][]): boolean { -