leetcode 40. Combination Sum II

class Solution {public:vector<vector<int>> combinationSum2(vector<int>& candidates, int target){vector<int>temp;sort(candidates.begin(), candidates.end());process(candidates, 0, target);return res;}private:vector<vector<int>> res;vector<int>temp;void process(vector<int>&candidates, int left, int target){if (target == 0){res.push_back(temp);return;}for (int i = left; i < candidates.size() && candidates[i] <= target; i++){temp.push_back(candidates[i]);process(candidates, i + 1, target - candidates[i]);while (i + 1 < candidates.size() && candidates[i] == candidates[i + 1]){i++;}temp.pop_back();}}};