LeetCode 17. 电话号码的字母组合 C++ python

特别注意输入为空的时候

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        vector<string> res;
        if(digits.empty())
            return res;
        map<char, string> numToStr;  
        numToStr['2']="abc";  
        numToStr['3']="def";  
        numToStr['4']="ghi";  
        numToStr['5']="jkl";  
        numToStr['6']="mno";  
        numToStr['7']="pqrs";  
        numToStr['8']="tuv";  
        numToStr['9']="wxyz"; 
        find(digits, 0, "", res, numToStr);
        return res;
    }
    void find(string digits, int idx, string s, vector<string> &res, map<char, string> numToStr){
        if(idx == digits.size())
            res.push_back(s);
        else
            for(int i = 0; i < numToStr[digits[idx]].size(); i++)
                find(digits, idx+1, s+numToStr[digits[idx]][i], res, numToStr);
    }
};

class Solution(object):
    def letterCombinations(self, digits):
        """
        :type digits: str
        :rtype: List[str]
        """
        # 创建字母对应的字符列表的字典
        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'],
               }
        # 存储结果的数组
        ret_str = []
        if len(digits) == 0: return []
        # 递归出口，当递归到最后一个数的时候result拿到结果进行for循环遍历
        if len(digits) == 1:
            return dic[int(digits[0])]
        # 递归调用
        result = self.letterCombinations(digits[1:])
        # result是一个数组列表，遍历后字符串操作，加入列表
        for r in result:
            for j in dic[int(digits[0])]:
                ret_str.append(j + r)
        return ret_str