leetcode 刷题之路 24 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] 

这道题目在Combination Sum基础上增加了限制条件，数组中的每个数字在求和过程中只能使用一次。Combination Sum程序中，若target大于当前数字时，会在在当前数字位置递归调用helper函数，这样得到的结果中可能会出现重复数字的组合，将这一部分程序去掉就可以得到本题的答案。

Combination Sum题目解答过程可以参考链接Combination Sum。

测试通过程序：

class Solution {
public:
	vector<vector<int> > combinationSum2(vector<int> &num, int target)
	{
		vector<vector<int>> ret;
		vector<int> temp;
		helper(num, ret, temp, 0, target);
		for (int i = 0; i < ret.size(); i++)
			sort(ret[i].begin(), ret[i].end());
		sort(ret.begin(), ret.end());	
		vector<vector<int>>::iterator iter=unique(ret.begin(), ret.end());	//unique去除相邻的重复元素
		ret.erase(iter, ret.end());
		return ret;
	}
	static void helper(vector<int> &num, vector<vector<int>> &ret, vector<int> &temp, int current, int target)
	{
		if (current == num.size())
			return;
		if (target == num[current])
		{
			temp.push_back(num[current]);
			ret.push_back(temp);
			temp.pop_back();
		}
		else if (target>num[current])
		{
			temp.push_back(num[current]);
			helper(num, ret, temp, current + 1, target - num[current]);
			temp.pop_back();
		}
		helper(num, ret, temp, current + 1, target);
	}
};