C++ 代码

class Solution {
public:
    vector<vector<int>> ans;
    vector<int> path;
    void dfs(vector<int> &a,int sum,int start)
    {
        if(sum<0 )return ;
        if(sum==0) ans.push_back(path);
        for(int i=start;i<a.size();i++)
        {
            if(i>start && a[i] ==a[i-1])
                continue;
            path.push_back(a[i]);
            dfs(a,sum-a[i],i+1);
            path.pop_back();
        }
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        dfs(candidates,target,0);
        return ans;
    }
};