leetcode 39. 组合总和

class Solution {
private:
    vector<vector<int>> res;
    vector<int> path;
   //int sum=0;
public:
    void dfs(vector<int>& candidates,int n,int target,int sum){
        if (sum > target) {
            return;//这里第一次忽视了 导致内存溢出
        }
        if(sum==target){
            res.push_back(path);
            return;
        }
        for(int i=n;i<candidates.size();i++){
            path.push_back(candidates[i]);
            sum+=candidates[i];
            //sum是要当成一个参数传进递归的 不能定义在外面
            dfs(candidates,i,target,sum);//这块又写成n了 倒是记得不用加一
            sum-=candidates[i];
            path.pop_back();
        }
        
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        //sort(candidates.begin(),candidates.end());
        dfs(candidates,0,target,0);
        return res;     
    }
};