LeetCode - Letter Combinations of a Phone Number
Given a digit string, 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.
Input: Digit string “23”
Output: [“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].Note:
Although the above answer is in lexicographical order, your answer could be in any order you want.
My solution is as following:
class Solution:
# @param {string} digits
# @return {string[]}
def letterCombinations(self, digits):
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')}
result = []
for i in digits:
if result == []:
for item in dic[i]:
result.append(item)
else:
tmpresult = []
for tmp in result:
for item in dic[i]:
tmpresult.append(tmp+item)
result = tmpresult
return result