Leetcode-Python 电话号码的字母组合

class Solution:
    def letterCombinations(self, digits: str) -> [str]:
        dirc = {'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}
        result = []
        if len(digits) != 0:
            for d in digits:
                result = self.change(result,dirc[d])
        return result
                
    def change(self,res,string):
        result = []
        if len(res) != 0:
            for r in res:
                for w in string:
                    result.append(r+w)
        else:
            for w in string:
                result.append(w)
        return result

github项目地址：https://github.com/JockWang/LeetCode-Python