LeetCode 40. Combination Sum II

Combination Sum II - LeetCode

Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

Each number in candidates may only be used once in the combination.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
Example 1:

Input: candidates = [10,1,2,7,6,1,5], target = 8,
A solution set is:

[
  [1, 7],
  [1, 2, 5],
  [2, 6],
  [1, 1, 6]
]

Example 2:

Input: candidates = [2,5,2,1,2], target = 5,
A solution set is:

[
  [1,2,2],
  [5]
]

---

遇到重复元素需要跳过

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