-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path017_letterPhoneNum.py
47 lines (39 loc) · 1.27 KB
/
017_letterPhoneNum.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
import copy
class Solution:
def letterCombinations(self, digits):
dig_dict = {'1':"",
'2':"abc",
'3':"def",
'4':"ghi",
'5':"jkl",
'6':"mno",
'7':"pqrs",
'8':"tuv",
'9':"wxyz",
'0':""}
res = []
temp = []
cnt = 0
for digit in digits:
if digit == '1':
continue
#print(digit)
for letter in dig_dict[digit]:
print(letter)
if cnt == 0:
res.append(letter)
else:
for item in res:
item = item + letter
temp.append(item)
if temp != []:
res = temp
temp = []
#print(res)
#print(temp)
#temp = []
cnt = cnt + 1
return res
print(Solution().letterCombinations(digits = "23")) #["ad","ae","af","bd","be","bf","cd","ce","cf"]
#print(Solution().letterCombinations(digits = ""))
#print(Solution().letterCombinations(digits = "2"))