leetcode之Letter Combinations of a Phone Number

来源:互联网 发布:小米4支持什么网络 编辑:程序博客网 时间:2024/06/09 19:09

这个没什么好说的,就是每个数字代表的字母的排列组合。代码如下:

class Solution(object):    def letterCombinations(self, digits):        """        :type digits: str        :rtype: List[str]        """        phonenumber = [[' '], ['*'],['a', 'b', 'c'], ['d', 'e', 'f'], ['g', 'h','i'], ['j', 'k', 'l'], ['m', 'n', 'o'], ['p', 'q','r', 's'], ['t', 'u', 'v'], ['w', 'x', 'y', 'z']]                if len(digits) == 0:            return []        elif len(digits) == 1:            return phonenumber[int(digits)]        else:            result = phonenumber[int(digits[0])]            for i in range(1, len(digits)):                m = []                for j in result:                    for k in phonenumber[int(digits[i])]:                        m.append(j + k)                result = m        return result


0 0