10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T52b,import java.util.*; class Solution { public int ladderLength(String beginWord, String endWord, List wordList) { Set set = new HashSet<>(wordList); if (!set.contains(endWord)) return 0; Queue queue = new LinkedList<>(); queue.add(beginWord); int level = 1; while (!queue.isEmpty()) { int size = queue.size(); for (int i = 0; i < size; i++) { String current = queue.poll(); char[] word_chars = current.toCharArray(); for (int j = 0; j < word_chars.length; j++) { char original_char = word_chars[j]; for (char c = 'a'; c <= 'z'; c++) { if (word_chars[j] == c) continue; word_chars[j] = c; String new_word = String.valueOf(word_chars); if (new_word.equals(endWord)) return level + 1; if (set.contains(new_word)) { queue.add(new_word); set.remove(new_word); } } word_chars[j] = original_char; } } level++; } return 0; } }13:T4bc,#include #include #include #include #include using namespace std; class Solution { public: int ladderLength(string beginWord, string endWord, vector& wordList) { unordered_set dict(wordList.begin(), wordList.end()); if (dict.find(endWord) == dict.end()) return 0; queue q; q.push(beginWord); int length = 1; while (!q.empty()) { int qlen = q.size(); for (int i = 0; i < qlen; i++) { string word = q.front(); q.pop(); if (word == endWord) return length; for (int j = 0; j < word.size(); j++) { char original = word[j]; for (char c = 'a'; c <= 'z'; c++) { word[j] = c; if (dict.find(word) != dict.end()) { dict.erase(word); q.push(word); } } word[j] = original; } } length++; } return 0; } };

Time Complexity

Space Complexity