LeetCode 216. Combination Sum III 解题报告（python）

216. Combination Sum III

216. Combination Sum III

题目描述

Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.
Note:
All numbers will be positive integers.
The solution set must not contain duplicate combinations.

解析

题目比较容易理解，1到9中，选择k个数，是他们的和为n
先给出最简单粗暴的解法

from itertools import combinations

class Solution:
    def combinationSum3(self, k, n):
        return [c for c in combinations(range(1, 10), k) if sum(c) == n]

再来一个常规解法

class Solution(object):
    def combinationSum3(self, k, n):
        self.output = []
        arr = [1, 2, 3, 4, 5, 6, 7, 8, 9]
        self.compute([], arr, k, n)
        return self.output
    
    def compute(self, pre, post, k, n):
        if len(pre) == k and n == 0:
            self.output.append(pre)
        elif n < 0 or len(pre) > k:
            return
        else:
            for i in range(0, len(post)):
                #print(pre+[post[i]])
                self.compute(pre+[post[i]], post[i+1:], k, n-post[i])

但实际上二者的运行时间基本一致

Reference

https://leetcode.com/problems/combination-sum-iii/discuss/60805/Easy-to-understand-Python-solution-(backtracking).