39. Combination Sum

Given a set of candidate numbers (C) (without duplicates) 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.
• The solution set must not contain duplicate combinations.

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

[
  [7],
  [2, 2, 3]
]

找combination，每个数字可以重复使用，是递归的题目， 代码如下：

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        vector<vector<int>> res;
        vector<int> curcom;
        dfs(candidates, 0, target, res, curcom);
        return res;
    }
    void dfs(vector<int>& candidates, int start, int target, vector<vector<int>>& res, vector<int>& curcom) {
        if (target == 0) {
            res.push_back(curcom);
            return ;
        }
        if (target < 0) return ;
        for (int i = start ; i < candidates.size(); i++) {
            curcom.push_back(candidates[i]);
            dfs(candidates, i, target-candidates[i], res, curcom);//从i开始，因为可以重复
            curcom.pop_back();
        }
    }
};