LeetCode Combination Sum II
来源:互联网 发布:聊天软件遇见 编辑:程序博客网 时间:2024/06/01 18:09
题目:
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums toT.
Each number in C may only be used once in the combination.
Note:
- All numbers (including target) will be positive integers.
- The solution set must not contain duplicate combinations.
For example, given candidate set [10, 1, 2, 7, 6, 1, 5]
and target 8
,
A solution set is:
[ [1, 7], [1, 2, 5], [2, 6], [1, 1, 6]]题意:
给定一个数组和一个target,那么要求在这一数组中寻找任意的组合,使其和等于给定的target,遇到好几组相同的,要去重。那么也是考虑用DFS来做,结合递归的思路。此题与上一题思路一致,我们都可以采用相同的思路,只是每一次内层递归结束,退出到外层时,等在原始数组中对下一个数组元素进行判断,看它是不是与之前的那个元素一致,如果相同,那么指针继续往后面走。这里是需要注意的。
public class combinationSum2 {public List<List<Integer>> combinationSum2(int[] candidates,int target){List<List<Integer>> list = new ArrayList<List<Integer>>();ArrayList<Integer> l = new ArrayList<Integer>();int length = candidates.length;if(length == 0 || list == null)return list;Arrays.sort(candidates);dfs(candidates,target,0,length,0,list,l);return list;}public void dfs(int[] nums,int target,int start,int n,int sum,List<List<Integer>> list,ArrayList<Integer> l){if(sum == target){list.add(new ArrayList<Integer> (l));return;}if(sum > target)return;for(int j = start; j < n; j++){l.add(nums[j]);dfs(nums,target,j + 1,n,sum + nums[j],list,l);l.remove(l.size() - 1);while(j < n -1){if(nums[j] == nums[j + 1])j++;elsebreak;}}}}
0 0
- LeetCode: Combination Sum II
- LeetCode: Combination Sum II
- [LeetCode]Combination Sum II
- LeetCode Combination Sum II
- [Leetcode] Combination Sum II
- [LeetCode] Combination Sum II
- LeetCode Combination Sum II
- [Leetcode] Combination Sum II
- LeetCode: Combination Sum II
- leetcode Combination Sum II
- [LeetCode]Combination Sum II
- [leetcode] Combination Sum II
- LeetCode-Combination Sum II
- LeetCode - Combination Sum II
- LeetCode:Combination Sum II
- 【Leetcode】Combination Sum II
- Combination Sum II 【leetcode】
- [LeetCode] Combination Sum II
- 上海迪士尼乐园史上最强游玩攻略
- 很喜欢CSDN这个社区,所以来安家了
- PCB布线技巧(经验)
- 最小的K个数
- 机器学习系列(12)_XGBoost参数调优完全指南(附Python代码)
- LeetCode Combination Sum II
- Hadoop之——再谈Hadoop的PRC机制
- 北京网赛I题 hiho1391 (树状数组、区间覆盖最大值问题)
- 任务3 理解Task
- 如何设计出让人眼前一亮的交互框架?
- 【编程素质】代码注释
- 搭建一个App框架及相应的源码分析(EventBus+RxJava+Rxtrofit+OkHttp+Dagger2)及三方SDK等
- Python--第3天:一大波金融Library来袭之numpy篇
- 开发记录——EXCEL导出