216.组合总和III相较于组合问题多了一个剪枝操作:当前总和大于目标总和时候,直接剪枝 class Solution: def combinationSum3(self, k: int, n: int) -> List[List[int]]: result = [] # 存放结果集 self.backtracking(n, k, 0, 1, [], result) return result def backtracking(self, targetSum, k, currentSum, startIndex, pat...