题目:
解答:
深搜,记得最后的结果要排序。
代码:
class Solution {
public:
vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
vector<int> temp;
vector<vector<int> > res;
if (candidates.size() == 0)
return res;
search(target, res, temp, 0, candidates);
for (int i = 0; i < res.size(); i++)
{
sort(res[i].begin(), res[i].end());
}
return res;
}
private:
void search(int sum, vector<vector<int> > &res, vector<int> &temp, int pos, vector<int> &candidates)
{
if (sum == 0)
{
res.push_back(temp);
return;
}
if (sum < 0)
{
return;
}
for (int i = pos; i < candidates.size(); i++)
{
sum -= candidates[i];
temp.push_back(candidates[i]);
search(sum, res, temp, i, candidates);
sum += candidates[i];
temp.pop_back();
}
}
};