【leetcode】Combination Sum

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 (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
• 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]
思路：
这个题目和path sum 2问题很像，但是却别在于这个数可以重复计算（这个用num来记录），因此还是用temp来记录当前的情况，当然，每次都得弹出，便于平行情况的计算。

class Solution {
public:
    vector<vector<int> > res;
    vector<int> temp;

    void combination(vector<int>& candidates, int num,int tempsum, int target)
    {
        if(tempsum>target) return;
        if(tempsum==target)
        {
            res.push_back(temp);
            return;
        }
        for(int i=num; i<candidates.size();i++)
        {
            tempsum=tempsum+candidates[i];
            temp.push_back(candidates[i]);
            combination(candidates, i, tempsum, target);
            temp.pop_back();
            tempsum=tempsum-candidates[i];
        }
    }

    vector<vector<int> > combinationSum(vector<int>& candidates, int target) {
        if(candidates.size()==0) return res;
        sort(candidates.begin(),candidates.end());
        combination(candidates,0,0,target);
        return res;
    }
};