leetcode40组合总和 IIC++

1、题目

https://leetcode-cn.com/problems/combination-sum-ii/

2、题意

跟上一题leetcode39类似，只不过加一个特判重复元素即可，每次递归到i+1;

class Solution {
public:
    vector<int> temp;
    vector<vector<int>> res;
    void dfs(int start,vector<int>& c,int target)
    {
        if(target==0)
        {
            res.push_back(temp);
            return;
        }
        for(int i=start;i<c.size()&&target-c[i]>=0;i++)
        {
            if(i>start&&c[i]==c[i-1]) continue;//重复元素
            temp.push_back(c[i]);
            dfs(i+1,c,target-c[i]);
            temp.pop_back();
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        dfs(0,candidates,target);
        return res;
    }
};