###### Middle-题目54：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.
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%

#### Leetcode 39 Combination Sum & 40 Combination Sum II & 216 Combination Sum III & 377 Combination V

2016-07-26 13:38:06

#### [LeetCode39]Combination Sum

2014-06-17 04:15:23

#### Leetcode #39. Combination Sum 组合求和 解题报告

2016-04-10 23:42:47

#### leetCode 39.Combination Sum(组合总和) 解题思路和方法

2015-07-09 22:33:11

#### 回溯详解及其应用：Leetcode 39 combination sum

2017-01-31 16:47:37

#### 39. Combination Sum （重要）

2016-07-15 21:14:23

#### [leetcode]39. Combination Sum,python实现【Medium难度】

2016-06-16 17:01:20

#### leetcode 39. Combination Sum-回溯算法|递归|非递归

2016-03-15 17:37:26

#### leetcode【39+40+216+377 Combination Sum 相关】【python】

2016-12-13 16:38:48

#### [LeetCode]39.Combination Sum

2015-01-27 17:47:03

## 不良信息举报

Middle-题目54：39. Combination Sum