给定一个无重复元素的数组 candidates 和一个目标数 target ,找出candidates 中所有可以使数字和为 target 的组合。candidates 中的数字可以无限制重复被选取。
Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
The same repeated number may be chosen from candidates unlimited number of times.
说明:
所有数字(包括 target)都是正整数。
解集不能包含重复的组合。
Note:
All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
示例 1:
输入:candidates = [2,3,6,7], target = 7,
所求解集为:
[
[7],
[2,2,3]
]
示例 2:
输入:candidates = [2,3,5], target = 8,
所求解集为:
[
[2,2,2,2],
[2,3,3],
[3,5]
]
思路:回溯算法
Python:
def combinationSum(candidates, target):
res = []
combine = []
def dfs(target, idx):
if idx >= len(candidates): return
if target == 0:
# 这边要用到list的拷贝
res.append(combine[:])
return
# 直接跳过当前idx所在位置的数,所以target不变,idx+1
dfs(target, idx + 1)
if target - candidates[idx] >= 0:
combine.append(candidates[idx])
# 选择当前位置的数,因为可以无限重复选取,所以idx不变
dfs(target - candidates[idx], idx)
combine.pop()
dfs(target, 0)
return res
C++:
void dfs(vector<int>& candidates, vector<vector<int>>& res, int target, vector<int>& combine, int idx)
{
if (idx >= candidates.size()) return;
if (target == 0)
{
// C++中的push_back和emplace_back都是创建拷贝,所以可以直接使用
res.emplace_back(combine);
return;
}
dfs(candidates, res, target, combine, idx + 1);
if (target - candidates[idx] >= 0)
{
combine.emplace_back(candidates[idx]);
dfs(candidates, res, target-candidates[idx], combine, idx);
combine.pop_back();
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target)
{
vector<vector<int>> res;
vector<int> combine;
dfs(candidates, res, target, combine, 0);
return res;
}