# Middle-题目54：39. Combination Sum

70人阅读 评论(0)

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]

public class Solution {
public List<List<Integer>> combinationSum(int[] candidates, int target) {
Arrays.sort(candidates);
List<List<Integer>> list = new ArrayList<List<Integer>>();
backtrack(list, new ArrayList<Integer>(), candidates, target, 0);
return list;
}
private void backtrack(List<List<Integer>> list, List<Integer> sublist, int[] candidates, int target, int startPos) {
if(target == 0) {
}
else {
for(int i = startPos; i < candidates.length; i++) {
int temp = candidates[i];
if(temp <= target) {
backtrack(list,sublist,candidates,target-temp,i);
sublist.remove(sublist.size()-1);
}
}
}
}
}

6ms,beats 64.44%,众数5ms,24.50%

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：63770次
• 积分：3280
• 等级：
• 排名：第10739名
• 原创：270篇
• 转载：53篇
• 译文：0篇
• 评论：8条
文章分类
阅读排行
最新评论