组合总和Ⅲ
找出所有相加之和为 n 的 k 个数的组合。组合中只允许含有 1 - 9 的正整数,并且每种组合中不存在重复的数字。
说明:
- 所有数字都是正整数
- 解集不能包含重复的组合
示例 1:
输入: k = 3, n = 7
输出: [[1,2,4]]
示例 2:
输入: k = 3, n = 9
输出: [[1,2,6], [1,3,5], [2,3,4]]
这道题和前面系列的题原理上依然逃不出回溯法的套路,不同之处在于要求的结果不同。解集中的结果不仅要求之和等于给定的n
,而且每个结果所包含的元素个数等于k
。所以,我们需要在选择过程中最后保存结果时进行剪枝操作。
Java解题代码如下:
class Solution {
public List<List<Integer>> combinationSum3(int k, int n) {
List<List<Integer>> results = new LinkedList<>();
LinkedList<Integer> track = new LinkedList<>();
int[] candidates = {1, 2, 3, 4, 5, 6, 7, 8, 9};
dfs(track, candidates, n, k, results, 0);
return results;
}
public void dfs(LinkedList<Integer> track, int[] candidates, int n, int k, List<List<Integer>> results, int start) {
if(n == 0 && track.size() == k){
results.add(new LinkedList<>(track));
return;
}
for (int i = start; i < candidates.length; i++) {
if (i == candidates.length || candidates[i] > n || track.size() > k){
break;
}
track.add(candidates[i]);
dfs(track, candidates, n - candidates[i], k, results, i + 1);
track.removeLast();
}
}
}
Python解题代码
class Solution:
def combinationSum3(self, k: int, n: int) -> List[List[int]]:
candidates = [i for i in range(1, 10)]
results = []
length = len(candidates)
def dfs(track, candidates, n, k):
if n == 0 and len(track) == k:
results.append(track.copy())
return
for i in range(len(candidates)):
if i > 0 and candidates[i] == candidates[i - 1]:
continue
if i == length or candidates[i] > n:
break
track.append(candidates[i])
dfs(track, candidates[i + 1 : ], n - candidates[i], k)
track.pop()
dfs([], candidates, n, k)
return results