leetcode 40: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 (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
• 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] 

思路：

首先，还是先对数组进行排序。

从第一个元素开始，逐渐往后面取，知道大于target后再回溯，具体步骤如下：

1）确定第i个元素作为set的第一个元素,remain为target

2) if(remain==0) 将temp存到result里面

3) for循环，从i到num.size(),对每一次for循环都进行递归

if(num[i]>remain) 情况已经不满足，return.

防止重复处理，即如果和上一个相同，则continue.

将num[i]存入temp，然后递归调用，i加1，remain=remain-num[i]

取出temp中最后一个，用来回溯。

C++解法如下：

class Solution {
public:
	vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
		vector<vector<int>> result;
		int size = candidates.size();
		if (size == 0) return result;
		sort(candidates.begin(), candidates.end());
		vector<int> temp;
		back(0, candidates, temp, result, target);
		return result;
	}

	void back(int index,vector<int>& candidates, vector<int>& temp, vector<vector<int>>& result, int remain)
	{
		if (remain == 0)
		{
			result.push_back(temp);
			return;
		}
		for (int i = index; i < candidates.size(); i++)
		{
			if (candidates[i]>remain) return;
			if (i > 0 && candidates[i] == candidates[i - 1] && i>index) continue; //i>index是防止把第一次需要重复出现的也排除了
			temp.push_back(candidates[i]);
			back(i+1, candidates, temp, result, remain - candidates[i]);
			temp.pop_back();
		}
	}
};