代码随想录算法训练营Day25
Day25-[回溯算法]ans.append(path[:])哟
216. Combination Sum III
可以改进: backtrack直接传入当前的sum,不用反复调用sum(path)
class Solution:
def combinationSum3(self, k: int, n: int) -> List[List[int]]:
# nums = [x for x in range(1,10)]
ans = []
def backtrack(path: List[int], k: int, startIndex: int):
# print(path)
if len(path) == k