描述:
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums toT.
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]
思路:
1.基本思路和Combination Sum类似。
2.Combination Sum的思路:这种题目一般要用到递归或回溯两种方法,用回溯法试过,代码规模总是越来越庞大,但最终还是没能通过所有的测试用例,^-^!用递归的话这题目看着要容易理解的多,每递归一次target要变为target=target-candidates[i],并将开始index赋值为i,当target==0时,条件满足,如果target<candidates[i],这轮循环结束,方法出栈,当前的i++,继续循环。
3.作为Combination Sum的升级版本,本题需要做的就是对于排序后的数组同样的数组元素,不会在重复的数组元素上做相同的求Combination Sum的运算,这可以通过(i==begin||candidates[i]!=candidates[i-1])来保证。
代码:
public List<List<Integer>> combinationSum2(int[] candidates, int target)
{
List<List<Integer>>listResult=new ArrayList<List<Integer>>();
ArrayList<Integer>list=new ArrayList<Integer>();
Arrays.sort(candidates);
combination(listResult, list, candidates, target,0);
return listResult;
}
public void combination(List<List<Integer>>listResult,
ArrayList<Integer>list,int[] candidates, int target,int begin)
{
if(target==0)
{
listResult.add(list);
return;
}
for(int i=begin;i<candidates.length&&target>=candidates[i];i++)
{
if(i==begin||candidates[i]!=candidates[i-1])
{
ArrayList<Integer>copy=new ArrayList<Integer>(list);
copy.add(candidates[i]);
combination(listResult, copy, candidates,target- candidates[i],i+1);
}
}
}