class Solution:
def letterCombinations(self, digits: str) -> List[str]:
dictionary={'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']}
results=[]
def callback(res,next_dig):
if len(next_dig)==0:
results.append(res)
else :
for i in dictionary[next_dig[0]]:
callback(res+i,next_dig[1:])
if digits:
callback("",digits)
else:
pass
return results
这次主要是学习了回溯的思想,进行一次一次的迭代,这个字符串相加的地方是真的巧妙。