leetcode JAVA Combination Sum 难度系数3 3.13
来源:互联网 发布:中国保险网络大学答案 编辑:程序博客网 时间:2024/06/06 12:50
Question:
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 ArrayList<ArrayList<Integer>> combinationSum(int[] candidates,int target) {ArrayList<ArrayList<Integer>> results = new ArrayList<ArrayList<Integer>>();if (candidates.length == 0) {return results;}Arrays.sort(candidates);ArrayList<Integer> result = new ArrayList<Integer>();dfs(results, candidates, target, result, 0, 0);return results;}private void dfs(ArrayList<ArrayList<Integer>> results, int[] candidates,int target, ArrayList<Integer> result, int step, int sum) {if (sum == target) {if (!results.contains(result)) {results.add(new ArrayList<Integer>(result));}return;}if (sum > target) {return;}for (int i = step; i < candidates.length; i++) {result.add(candidates[i]);dfs(results, candidates, target, result, i, sum + candidates[i]);result.remove(result.size() - 1);}return;}}
0 0
- leetcode JAVA Combination Sum 难度系数3 3.13
- leetcode JAVA Minimum Path Sum 难度系数3 3.22
- leetcode 3Sum 难度系数 3.6
- leetcode 4Sum 难度系数3 3.9
- leetcode JAVA Permutations 难度系数3 3.14
- leetcode JAVA Anagrams 难度系数3 3.15
- leetcode JAVA Combinations 难度系数3 3.26
- leetcode JAVA Subsets 难度系数3 3.27
- leetcode JAVA Triangle 难度系数3 3.42
- leetcode 3Sum Closest 难度系数3 3.7
- leetcode Path Sum 1.2 难度系数1
- leetcode Two Sum 2.1 难度系数2
- LeetCode[377. Combination Sum IV] 难度[medium]
- leetcode JAVA Pow(x, n) 难度系数3 3.16
- leetcode JAVA Maximum Subarray 难度系数3 3.17
- leetcode JAVA Jump Game 难度系数3 3.18
- leetcode JAVA Spiral Matrix II 难度系数3 3.19
- leetcode JAVA Rotate List 难度系数3 3.20
- leetcode JAVA Substring with Concatenation of All Words 难度系数3 3.12
- Never Worry About Money Again!
- 无法启动mysql服务,错误1067(请先检查mysql日志错误,对症下药)
- 寒假学习 第13,14天 (linux 高级编程)
- 新年,未知的开始---Created by 思贤泪自潸
- leetcode JAVA Combination Sum 难度系数3 3.13
- HDU1024 Max Sum Plus Plus
- UVA 10600 - ACM Contest and Blackout 次小生成树
- Android拼图游戏开发全纪录2
- leetcode JAVA Permutations 难度系数3 3.14
- [MDIT每天一小时]Window系统搭建Android开发环境(最全最详细)
- 时无英雄,遂使竖子成名—— 烂懦夫收购摩托罗拉移动有感
- 虚拟机不能启动,E_FAIL(0x80004005) 错误极其处理
- 45 个非常有用的 Oracle 查询语句