40. Combination Sum II

回溯，因为每个数字只能出现一次，所以当下一个数字和当前数字相同时，若当前数退出时，下一个数不需要进栈了

class Solution {
public:
    void GetRes(vector<int>& nums,int sta,vector<vector<int>>& res,int sum,vector<int> ans,int target)
    {
        if(sum==target&&ans.size()>0)
        {
            res.push_back(ans);
            return;
        }
        if(sum>target)
            return;
        for(int i=sta;i<nums.size();i++)
        {
            ans.push_back(nums[i]);
            GetRes(nums,i+1,res,sum+nums[i],ans,target);
            ans.pop_back();
            while(i+1<nums.size()&&nums[i+1]==nums[i])
                i++;
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> res;
        vector<int> ans;
        
        sort(candidates.begin(),candidates.end());
        GetRes(candidates,0,res,0,ans,target);
        return res;
    }
};