[Leetcode] Combination Sum II

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

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

Note:

• All numbers (including target) will be positive integers.
• Elements in a combination (a₁, a₂, … , a_k) must be in non-descending order. (ie, a₁ â‰¤ a₂ â‰¤ … ≤ a_k).
• The solution set must not contain duplicate combinations.

For example, given candidate set 10,1,2,7,6,1,5 and target 8, 
A solution set is: 
[1, 7] 
[1, 2, 5] 
[2, 6] 
[1, 1, 6] 

DFS 啦！Tricky 之处是避免重复，方法是引入一个bool型的vector，记录每个数字是否被用过。如果两个数字值相同，那只有前一个数字用过之后才能用后一个数。这也是解决重复的通用方法。

class Solution {
public:
    vector<vector<int> > combinationSum2(vector<int> &num, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        sort(num.begin(),num.end());
        vector<vector<int> > solution;
        vector<int> answer;
    	vector<bool> used(num.size(),false);
        dfs(used,solution,answer,num,0,target);
        return solution;        
    }
    
    void dfs(vector<bool> &used, vector<vector<int> > &solution, vector<int> &answer,vector<int> &num, int depth, int target)
    {
            
        if(target==0)
        {
            solution.push_back(answer);
            return;
        }
        
        if(target<num[depth])//剪枝
        {
            return;
        }
        
        for(int i=depth;i<num.size();i++)
        {
			if(i!=0 && num[i] == num[i-1] && used[i-1]==false)
			{
			}
			else
			{
				answer.push_back(num[i]);
				used[i] = true;
				dfs(used,solution,answer,num,i+1,target-num[i]);
				answer.pop_back();
				used[i] = false;
			}
        }
    }
};