LeetCode-040：Combination Sum II

题目：

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]
]

题意：

跟上一题一样，找出数组中任意个元素的和为target的集合；但是要求不能有重复的方案

思路：

因为可能有重复元素，故对数组先进行sort排序处理，然后在dfs递归中必须保证第一个位置以一个数值递归下去时不能重复！但第一次遍历时又必须保存

Code：

class Solution {
public:
    vector<vector<int>> q;
    vector<int> t;
    int len;
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        len=candidates.size();
        sort(candidates.begin(),candidates.end());
        dfs(0,0,target,candidates);
        return q;
    }
    void dfs(int start,int sum,int target,vector<int> candidates){
        if(sum==target){
            q.push_back(t);
            return;
        }
        else if(sum>target) return;
        else{
            for(int i=start;i<len;i++){
                if(i>start&&candidates[i]==candidates[i-1]) continue;//第一次遍历时须保存，所以写成i>start;比如：1,12,5,6,7,10  8    【1,2,5】 【1,2,5】 【1,1,6】***不能出现两次125
                t.push_back(candidates[i]);
                dfs(i+1,sum+candidates[i],target,candidates);
                t.pop_back();
            }
        }
    }
};