leetcode每日一题第166天

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
public:
    void backtracing(vector<int>& candidates,int target,int sum,int startindex)
    {
        if(sum == target)
        {
            result.push_back(path);
            return;
        }
        for(int i = startindex;i<candidates.size() && sum+candidates[i] <= target;i++)
        {
            path.push_back(candidates[i]);
            sum+=candidates[i];
            backtracing(candidates,target,sum,i);
            sum-=candidates[i];
            path.pop_back();
        }
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        result.clear();
        path.clear();
        sort(candidates.begin(),candidates.end());
        backtracing(candidates,target,0,0);
        return result;
    }
};