###### leetcode-java-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]
]
*/
/*

1.如果sum>target直接返回
2.如果sum=target则保存结果

*/
public class Solution {
public List<List<Integer>> result;
public List<Integer> seq;

public List<List<Integer>> combinationSum(int[] candidates, int target) {
result  = new ArrayList<List<Integer>>();
seq = new ArrayList<Integer>();

Arrays.sort(candidates);
findPaths(candidates,target,0,0);

return result;
}

public void findPaths(int[] candidates,int target,int sum,int level) {
if(target == sum) {
return;
}
if(target < sum) {
return;
}

for(int i = level;i < candidates.length;i++) {
//  相当于是当前节点压入栈
sum += candidates[i];
findPaths(candidates,target,sum,i);
//  没返回值，也就是当前节点不符合，则弹出栈的意思
seq.remove(seq.size() - 1);
sum -= candidates[i];
}
}
}


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

2017-01-31 16:47:37

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

2016-06-16 17:01:20

#### 377. Combination Sum IV-动态规划

2016-09-22 19:54:56

#### leetcode笔记：Combination Sum

2015-11-25 23:59:24

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

2016-03-15 17:37:26

#### [LeetCode39]Combination Sum

2014-06-17 04:15:23

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

2016-07-26 13:38:06

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

2016-04-10 23:42:47

#### 【LeetCode】Combination Sum I & II 解题报告

2014-12-16 11:06:12

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

2016-07-15 21:14:23

## 不良信息举报

leetcode-java-39. Combination Sum