leetcode-java-216. Combination Sum III

111人阅读 评论(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.
•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];
}
}
}

0
0

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