LeetCode#17 Python解

看到这题我就想到了廖雪峰的Python教程-列表生成器
果然，题解里python3排名第一的解法就是这样
但是也如该答主所说，这样就锻炼不到这题想要考察的算法：回溯算法

class Solution:
    def letterCombinations(self, digits: str) -> List[str]:
        if digits == "":return []
        dic = { '2':['a','b','c'],
                '3':['d','e','f'],
                '4':['g','h','i'],
                '5':['j','k','l'],
                '6':['m','n','o'],
                '7':['p','q','r','s'],
                '8':['t','u','v'],
                '9':['w','x','y','z']}
        res = [""]
        for i in digits:
            res = [m + n for m in res for n in dic[i]]
        return res

我看着好绕啊，回溯算法，好吵啊一直讲话讲话讲话，我烦躁。。