[LeetCode] 17. Letter Combinations of a Phone Number

题目内容

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。

给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/

Given a string containing digits from 2-9inclusive, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.

Example:

Input: "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

---

题目思路

这道题目的思路在于可以把每一次对于字符的匹配看成一个双循环组成，一个是循环目前的res，另一个是循环目标数字所代表的字符串。初始的res被设定成含有一个空字符串的list，循环后更新结果，并进行下一轮循环。

---

程序代码

class Solution(object):
    def letterCombinations(self, digits):
        """
        :type digits: str
        :rtype: List[str]
        """
        if not digits:
            return []
        num={'2':'abc',
             '3':'def',
             '4':'ghi',
             '5':'jkl',
             '6':'mno',
             '7':'pqrs',
             '8':'tuv',
             '9':'wxyz'}
        res=['']
        for i in digits:
            temp=[m+n for m in res for n in num[i]]
            res=temp
        return res