216.组合总和III
题目链接/文章讲解:代码随想录
分析:此题与力扣77题的区别在于,77题返回1-n中k个数的组合,此题则是在1-9中选择k个数,使其和为n
class Solution:
def combinationSum3(self, k: int, n: int) -> List[List[int]]:
res = []
tmp = []
def backtracing(tmp,index):
if sum(tmp) == n and len(tmp) == k:
res.append(tmp[:])
return
for i in range(index,10):
tmp.append(i)
backtracing(tmp,i+1)
tmp.pop()
backtracing(tmp,1)
return res
17.电话号码的字母组合
题目链接/文章讲解:代码随想录
分析:建立字典,存放电话号码和字符之间的映射关系,采用回溯的方式,挨个遍历
class Solution:
def letterCombinations(self, digits: str) -> List[str]:
hash_table = {'2':'abc','3':'def','4':'ghi','5':'jkl','6':'mno','7':'pqrs','8':'tuv','9':'wxyz'}
if len(digits) == 0:
return []
res = []
tmp = []
def backtracing(digits,index):
if len(tmp) == len(digits):
res.append(''.join(tmp))
return
for i in range(len(hash_table[digits[index]])):
tmp.append(hash_table[digits[index]][i])
backtracing(digits,index+1)
tmp.pop()
backtracing(digits,0)
return res