leetcode-39. 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.
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]
]
这是一道标准的回溯法的题,基本结构都是固定的。
helper里面先判断终止条件:
- 如果res==0则说明结果已找到,新建一个List对象放到ret结果中,
- 如果res小于0则说明目前list中对象不满足条件。
- 如果res大于0:
- 需要从当前i开始进行下一个helper的pos的判断。由于不限制取值条件,则下一层迭代的pos的取值就是i。
- 另外由于java对于非基本类型的参数传递是引用传递则需要状态恢复。也就是list的add和remove操作。
public class Solution {
public List<List<Integer>> combinationSum(int[] candidates, int target) {
List<List<Integer>> ret = new ArrayList<List<Integer>>();
helper(ret,candidates,new ArrayList<Integer>(),0,target);
return ret;
}
private void helper(List<List<Integer>> ret, int[] can,List<Integer> list, int pos, int res){
if(res==0){
ret.add(new ArrayList<Integer>(list));
return;
}
if(res<0) return ;
for(int i = pos ; i<can.length ; i++){
list.add(can[i]);
helper(ret,can,list,i,res-can[i]);
list.remove(list.size()-1);
}
}
}