LeetCode 126. Word Ladder II

Given two words (beginWord and endWord), and a dictionary’s word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:

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.
Note:

Return an empty list 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.

Example 1:

Input:
beginWord = "hit",
endWord = "cog",
wordList = ["hot","dot","dog","lot","log","cog"]

Output:
[
  ["hit","hot","dot","dog","cog"],
  ["hit","hot","lot","log","cog"]
]

Example 2:

Input:
beginWord = "hit"
endWord = "cog"
wordList = ["hot","dot","dog","lot","log"]

Output: []

Explanation: The endWord "cog" is not in wordList, therefore no possible transformation.

解法：BFS，我是在queue里存了从beginWord到第i个word的所有list。直到找到endWord，返回所有list，但是空间复杂度比较高。优化的方案，可以把bfs的图给建出来，然后dfs找答案。

class Solution {
    public List<List<String>> findLadders(String beginWord, String endWord, List<String> wordList) {
        List<List<String>> results = new ArrayList<>();
        HashSet<String> set = new HashSet<>();
        for (int i = 0; i < wordList.size(); i++) {
            set.add(wordList.get(i));
        }
        Queue<List<String>> q = new LinkedList<>();
        List<String> l = new ArrayList<>();
        Set<String> map = new HashSet<>();
        l.add(beginWord);
        q.offer(l);
        boolean found = false;
        while (!q.isEmpty()) {
            int index = 0;
            int len = q.size();
            while (index++ < len) {
                List<String> list = q.poll();
                StringBuilder cur = new StringBuilder(list.get(list.size()-1));
                for (int i = 0; i < cur.length(); i++) {
                    char c = cur.charAt(i);
                    for (int j = 0; j < 26; j++) {
                        if (c == (char)(j + 'a')) continue;
                        cur.setCharAt(i, (char)(j + 'a'));
                        String str = cur.toString();
                        if (set.contains(str)) {
                            if (str.equals(endWord)) {
                                found = true;
                                List<String> ll = new ArrayList<>(list);
                                ll.add(endWord);
                                results.add(ll);
                            } else {
                                List<String> ll = new ArrayList<>(list);
                                ll.add(str);
                                q.offer(ll);
                            }
                        }
                        cur.setCharAt(i, c);
                    }
                }
                set.remove(cur.toString());
                map.add(cur.toString());
            } 
            if (found) return results;
            index = 0;
            len = q.size();
        }
        return results;
    }
}