一、题目链接
二、题目分析
(一)算法标签
DFS 回溯
(二)解题思路
三、AC代码
解法一:
class Solution {
public:
vector<int> path;
vector<vector<int>> res;
void dfs(int u, int sum, int target, vector<int> candidates)
{
if (sum > target) return;
if (sum == target)
{
res.push_back(path);
return;
}
for (int i = u; i < candidates.size(); i ++ )
{
sum += candidates[i];
path.push_back(candidates[i]);
dfs(i, sum, target, candidates);
path.pop_back();
sum -= candidates[i];
}
}
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
sort(candidates.begin(), candidates.end());
dfs(0, 0, target, candidates);
return res;
}
};