leetcode-126

class Solution:
    def findLadders(self, beginWord: str, endWord: str, wordList: List[str]) -> List[List[str]]:
        if endWord not in wordList:
            return []
        words=set(wordList)
        layer={}
        layer[beginWord]=[[beginWord]]

        while layer:
            newlayer=collections.defaultdict(list)
            for w in layer:
                if w==endWord:
                    return layer[w]
                for i in range(len(w)):
                    first=w[:i]
                    second=w[i+1:]
                    for c in string.ascii_lowercase:
                        neww=first+c+second
                        if neww in words:
                            newlayer[neww] +=[j+[neww] for j in layer[w]]

            words -=set(newlayer.keys())
            layer=newlayer
        return []