# Combination Sum

## 题目描述

Given a set of candidate numbers ( C ) and a target number ( T ), find all unique combinations in C where the candidate numbers sums to T .

The same repeated number may be chosen from C unlimited number of times.

Note:

• All numbers (including target) will be positive integers.
• Elements in a combination (a 1, a 2, … , a k) must be in non-descending order. (ie, a 1a 2 ≤ … ≤ a k).
• The solution set must not contain duplicate combinations.

For example, given candidate set2,3,6,7and target7,
A solution set is:
[7]
[2, 2, 3]

class Solution {
public:
vector<vector<int>> result;
vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
vector<int> temp; // 用于存放临时组合
sort(candidates.begin(), candidates.end());
// 结果要求输出的组合不能重复，需要去除candidates中的重复元素
candidates.erase(unique(candidates.begin(), candidates.end()), candidates.end());
combinationDFS(candidates, temp, 0, target);
return result;
}
void combinationDFS(vector<int> &candidates, vector<int> &temp, int index, int target)
{
if (target == 0) // 得到满足目标的一组解
{
result.push_back(temp);
return;
}
else
{
for (int i = index; i < candidates.size(); ++i)
{
if (candidates[i] > target)
return;
temp.push_back(candidates[i]);
combinationDFS(candidates, temp, i, target - candidates[i]);//每次都是从i开始
temp.pop_back();
}
}
}
};