<jupyter_start><jupyter_text>说明：    给定两个单词（beginWord和endWord）以及词典的单词列表，找到从beginWord到endWord的所有最短的转换序列，这样：    1、一次只能更改一个字母每个转换的单词都必须存在于单词列表中。    2、注意beginWord不是转换后的单词。注意：    1、如果没有这样的转换序列，请返回一个空列表。    2、所有单词的长度相同。    3、所有单词仅包含小写字母字符。    4、您可以假设单词列表中没有重复项。    5、您可以假设beginWord和endWord为非空并且不相同。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.<jupyter_code>class Solution:
    def findLadders(self, beginWord: str, endWord: str, wordList):
        pass
beginWord_ = "hit"
endWord_ = "cog"
wordList_ = ["hot","dot","dog","lot","log","cog"]
solution = Solution()
solution.findLadders(beginWord_, endWord_, wordList_)<jupyter_output><empty_output>
StarcoderdataJupyterStructuredCleanDedup