组合总和 II (Leetcode 暴力)

class Solution {
public:
    int p[1000];
    vector<vector<int>> ans;
    vector<int> v;
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        dfs(candidates,target,0,0,0);
        return ans;
    }
    void dfs(vector<int>& ve,int target,int now,int cnt,int pos){
        if(now==target){
            v.clear();
            for(int i=0;i<cnt;i++){
                v.push_back(p[i]);
            }
            
            ans.push_back(v);
            return ;
        }
        for(int i=pos;i<ve.size()&&now+ve[i]<=target;i++){
            if(i>pos&&ve[i]==ve[i-1]) continue ;
            p[cnt]=ve[i];
            dfs(ve,target,now+ve[i],cnt+1,i+1);
        }
    }
};