Python 小白的 Leetcode Daily Challenge 刷题计划 - 20230803

17. Letter Combinations of a Phone Number

class Solution:
    alph_dic = {2:'abc', 3:'def', 4:'ghi', 5:'jkl', 6:'mno', 7:'pqrs', 8:'tuv', 9:'wxyz'}

    def Combine_search(self, digits, num, x, cur, ans):
        if x == num:
            ans.append(cur)
            return
        for ch in self.alph_dic[int(digits[x])]:
            self.Combine_search(digits, num, x+1, cur+ch, ans)

    def letterCombinations(self, digits: str) -> List[str]:
        num = len(digits)
        ans = []
        if not num:
            return ans
        self.Combine_search(digits, num, 0, "", ans)
        return ans