[Leetcode] Combination Sum

题目：

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

The same repeated number may be chosen from C unlimited number of times.

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 2,3,6,7 and target 7, 
A solution set is: 
[7] 
[2, 2, 3] 

找到和为target的所有整数组合，题目要求比较多，给定的是无序的数列，某一个元素可以出现多次，输出的结果要是不重复的升序排列。跟之前的组合问题没有很大区别，都是回溯的结构。先要对元素排序，当数字和超过目标时就可以提前结束循环。代码如下：

vector<vector<int> > combinares;
bool combinationsum(vector<int> &input, vector<int> &candidates, int begin, int target)
{
	if(target<0) return true;
	if(target==0) 
	{
		combinares.push_back(candidates);
		return  true;
	}
	int flag=false;
	for(int i=begin; i<input.size(); i++)
	{
		candidates.push_back(input[i]);
		flag=combinationsum(input, candidates, i, target-input[i]);//能重复
		candidates.pop_back();
		if(flag) break;
	}
	return  false;
}
vector<vector<int> > combinationSum(vector<int> &candidates, int target)
{
	if(candidates.size()<1)  return combinares;
	vector<int> candidate;
        sort(candidates.begin(), candidates.end());
	combinationsum(candidates, candidate, 0, target);

	return combinares;
}