39. Combination Sum

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        vector<vector<int>> res;
        vector<int> combination;
        f(res,0,target,candidates,combination);
        return res;
    }
    void f(vector<vector<int>> &res,int n,int target,vector<int>& candidates,vector<int> &combination)
    {
        if(!target)
        {
            res.push_back(combination);
            return;
        }
        for(int i=n;i<candidates.size()&&target>=candidates[i];i++)
        {
            combination.push_back(candidates[i]);
            f(res,i,target-candidates[i],candidates,combination);//我的错误：i换成n+1
            combination.pop_back();
        }
    }
};