forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Word Ladder.java
40 lines (32 loc) · 1.25 KB
/
Word Ladder.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
class Solution {
public int ladderLength(String beginWord, String endWord, List<String> wordList) {
int count = 1;
Set<String> words = new HashSet<>(wordList);
Queue<String> q = new LinkedList<String>();
q.add(beginWord);
while(!q.isEmpty()) {
int size = q.size();
while(size-- > 0) {
String word = q.poll();
char[] chList = word.toCharArray();
for(int i=0; i<word.length(); i++) {
char tmp = chList[i];
for(char c='a'; c<='z'; c++) {
chList[i] = c;
String newWord = new String(chList);
if(words.contains(newWord)) {
if(newWord.equals(endWord)) {
return count + 1;
}
q.add(newWord);
words.remove(newWord);
}
}
chList[i] = tmp;
}
}
count++;
}
return 0;
}
}