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]

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>>res;
        sort(candidates.begin(),candidates.end());
        if(candidates.empty()||target<candidates.front()) //数组为空或者是target小于最小的数组元素
            return res;
        vector<int>slo;
        int sum=0;
        compute(sum,0,target,candidates,slo,res);
        return res;
    }
    
    void compute(int sum,int startIndex,int target,vector<int>&candidates,vector<int>&slo,vector<vector<int>>&res)
    {
        if(sum>target)
            return;
        if(sum==target)
        {
            res.push_back(slo);
            return;
        }
        for(int i=startIndex;i<candidates.size();i++)
        {
            sum+=candidates[i];
            slo.push_back(candidates[i]);
            compute(sum,i,target,candidates,slo,res);
            slo.pop_back();
            sum-=candidates[i];
        }
    }
};