【Leetcode】Combination Sum II-CSDN博客

本文链接：https://blog.csdn.net/hjiam2/article/details/17139047

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]

题意：给你一个动态数组num，一个正整数target，求num的子数组中总和为target的所有组合。

这题难度不大，主要关键点为：

1）对num进行排序，扫描时由大至小，当扫描到比target小的元素时，用target减去当前元素，并继续下一轮递归扫描。

2）若target为0，则表明当前的数组temp满足要求，将其赋给新的数组v，对v进行递增排序，然后push_into大数组ans中，这里之所以不直接对temp进行排序后push_into是因为temp返回上一级时需要pop_back，故不能改变temp中元素的相对顺序。

3）每次push_into数组v时，还需检查数组是否已经存在于ans中，如果已经存在，则直接返回，不push_into了。

class Solution {
public:
    vector<vector<int> > combinationSum2(vector<int> &num, int target) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
    	vector<vector<int>> ans;
    	if(num.empty())
    		return ans;
    	sort(num.begin(),num.end());
    	vector<int> temp;
    	combination(ans,num,temp,target,num.size()-1);
    	return ans;
    }

    void combination(vector<vector<int>> &ans,vector<int> &num,vector<int> &temp,int target,int pos)
    {
    	if(target==0)
    	{
    		vector<int> v=temp;
    		sort(v.begin(),v.end());
    		for(unsigned int i=0;i<ans.size();i++)
    		{
    			if(v==ans[i])
    				return;
    		}
    		ans.push_back(v);
    		return;
    	}
    	if(pos<0)
    	{
    		return;
    	}
    	for(int i=pos;i>=0;i--)
    	{
    		if(num[i]<=target)
    		{
    			temp.push_back(num[i]);
    			combination(ans,num,temp,target-num[i],i-1);
    			temp.pop_back();
    		}
    	}
    }
};