- Only one letter can be changed at a time.
- Each transformed word must exist in the word list. Note that beginWord is not a transformed word.
- Return 0 if there is no such transformation sequence.
- All words have the same length.
- All words contain only lowercase alphabetic characters.
- You may assume no duplicates in the word list.
- You may assume beginWord and endWord are non-empty and are not the same.
public int ladderLength(String beginWord, String endWord, List<String> wordList) {
HashSet<String> words = new HashSet<>();
words.addAll(wordList);
if (!words.contains(endWord)) return 0;
Queue<String> queue = new LinkedList<>();
queue.offer(beginWord);
int length = 1;
while (!queue.isEmpty()) {
Queue<String> queue2 = new LinkedList<>();
while (!queue.isEmpty()) {
beginWord = queue.poll();
HashSet<String> wordsWithinDistance = getWordsWithinDistance(beginWord, words);
if (wordsWithinDistance.contains(endWord)) return length + 1;
queue2.addAll(wordsWithinDistance);
}
length ++;
queue = queue2;
}
return 0;
}
private HashSet<String> getWordsWithinDistance(String word, HashSet<String> wordList) {
HashSet<String> set = new HashSet<>();
char[] array = word.toCharArray();
for (int i=0; i<array.length; i++) {
char origin = array[i];
for (int j=0; j<26; j++) {
char c = (char) ('a' + j);
if (c == origin) continue;
array[i] = c;
String s = new String(array);
if (wordList.remove(s)) {
set.add(s);
}
}
array[i] = origin;
}
return set;
}
discuss中有一個runtime很短的
public int ladderLength(String beginWord, String endWord, Set<String> wordList) {
Set<String> beginSet = new HashSet<String>(), endSet = new HashSet<String>();
int len = 1;
int strLen = beginWord.length();
HashSet<String> visited = new HashSet<String>();
beginSet.add(beginWord);
endSet.add(endWord);
while (!beginSet.isEmpty() && !endSet.isEmpty()) {
if (beginSet.size() > endSet.size()) {
Set<String> set = beginSet;
beginSet = endSet;
endSet = set;
}
Set<String> temp = new HashSet<String>();
for (String word : beginSet) {
char[] chs = word.toCharArray();
for (int i = 0; i < chs.length; i++) {
for (char c = 'a'; c <= 'z'; c++) {
char old = chs[i];
chs[i] = c;
String target = String.valueOf(chs);
if (endSet.contains(target)) {
return len + 1;
}
if (!visited.contains(target) && wordList.contains(target)) {
temp.add(target);
visited.add(target);
}
chs[i] = old;
}
}
}
beginSet = temp;
len++;
}
return 0;
}
改進點在於 他相當於從兩邊找 每次把size小的set作爲起始set 也就是主動的去縮小搜索空間 所以很快