给定一个无重复元素的数组 candidates 和一个目标数 target ,找出 candidates 中所有可以使数字和为 target 的组合。
candidates 中的数字可以无限制重复被选取。
示例 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]
]
class Solution {
private:
/* 递归时index不能省略,从index及之后的数字遍历,避免出现[2,2,3] [2,3,2]这种情况 */
void dfs(vector<int> &candidates, int target, int index, vector<int> &vecTmp, vector<vector<int>> &vecRes)
{
for(int i = index; i < candidates.size(); i++)
{
if(target < candidates[i])
{
return;
}
else if(target == candidates[i])
{
vecTmp.push_back(candidates[i]);
vecRes.push_back(vecTmp);
vecTmp.pop_back(); //注意此处也需要pop_back
return;
}
else
{
vecTmp.push_back(candidates[i]);
dfs(candidates, target-candidates[i], i, vecTmp, vecRes); //注意此处I值保持不变
vecTmp.pop_back();
}
}
}
public:
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
vector<int> vecTmp;
vector<vector<int>> vecRes;
sort(candidates.begin(), candidates.end());
dfs(candidates, target, 0, vecTmp, vecRes);
return vecRes;
}
};
使用递归回溯的方法,在递归里面遍历整个数组,注意与第40题组合总和II的区别