题目描述:
给定一个无重复元素的数组 candidates 和一个目标数 target ,找出 candidates 中所有可以使数字和为 target 的组合。
candidates 中的数字可以无限制重复被选取。
输入:
candidates = [2,3,6,7], target = 7
candidates = [2,3,5], target = 8
输出:
[
[7],
[2,2,3]
]
[
[2,2,2,2],
[2,3,3],
[3,5]
]
题意:
题目描述
题解:
简单dfs
代码:
class Solution {
List<List<Integer>> ans = new ArrayList<>();
public List<List<Integer>> combinationSum(int[] candidates, int target) {
int len = candidates.length;
for(int i = 0; i < len; i ++){
List<Integer> list = new ArrayList<>();
list.add(candidates[i]);
combinationSum_dfs(candidates,target - candidates[i],list,i);
list.remove(list.size() - 1);
}
return ans;
}
public void combinationSum_dfs(int [] candidates,int sum,List<Integer> list,int st){
if(sum == 0){
ans.add(new ArrayList<>(list));
return ;
}
if(sum < 0) return ;
int len = candidates.length;
for(int i = st; i < len; i ++){
list.add(candidates[i]);
combinationSum_dfs(candidates,sum - candidates[i],list,i);
list.remove(list.size() - 1);
}
}
}