Leetcode 127. 单词接龙python

        wordSet = set(wordList)
        print(wordSet)
        cur_level = [beginWord]
        print(cur_level)
        next_level = []
        depth = 1
        n = len(beginWord)  # 启示字符串长度
        while cur_level:
            for item in cur_level:
                print(item)
                if item == endWord:
                    return depth
                for i in range(n):
                    for c in 'abcdefghijklmnopqrstuvwxyz':
                        word = item[:i] + c + item[i + 1:]
                        if word in wordSet:
                            wordSet.remove(word)
                            next_level.append(word)
            # 树的下一层创建完毕
            depth += 1
            cur_level = next_level
            next_level = []
        return 0