Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit603ece7

Browse files
committed
126 (3) update solution
1 parent472fd59 commit603ece7

File tree

1 file changed

+3
-6
lines changed

1 file changed

+3
-6
lines changed

‎src/_126_WordLadderII/Solution.java

Lines changed: 3 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -30,7 +30,6 @@
3030
package_126_WordLadderII;
3131

3232
importjava.util.ArrayList;
33-
importjava.util.Arrays;
3433
importjava.util.Collections;
3534
importjava.util.HashMap;
3635
importjava.util.HashSet;
@@ -52,11 +51,6 @@ public List<List<String>> findLadders(String start, String end, Set<String> dict
5251

5352
List<List<String>>result =newArrayList<>();
5453

55-
if (start.equals(end)) {
56-
result.add(Arrays.asList(start,end));
57-
returnresult;
58-
}
59-
6054
// use set for current level instead of queue to avoid calculating ladder for duplicated word
6155
Set<String>cur =newHashSet<>();
6256
Set<String>visited =newHashSet<>();
@@ -106,6 +100,9 @@ public List<List<String>> findLadders(String start, String end, Set<String> dict
106100
privatevoiddfs(Stringstart,Stringend,List<String>path,Map<String,List<String>>fatherMap,List<List<String>>result) {
107101
path.add(end);
108102
if (end.equals(start)) {
103+
if (path.size() ==1) {
104+
path.add(start);
105+
}
109106
result.add(newArrayList<>(path));
110107
Collections.reverse(result.get(result.size() -1));
111108
}else {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp