【LC-17：电话号码的字母组合】

没有剪枝的回溯，称为递归（错

from typing import List

def letterCombinations(digits: str) -> List[str]:
    if not digits:
        return []
    phone = {'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']}
    temp = []
    def back(digits: str,test):
        test = []
        if not digits:
            return []
        if len(digits) == 1:
            test = phone[digits]
        else:
            temp_back = back(digits[1:],test)
            for i in phone[digits[0]]:    
                for j in temp_back:
                    test.append(i+j)
        return test
    temp = back(digits,temp)
    return temp

letterCombinations('234')