LeetCode : Combination Sum II [java]
来源:互联网 发布:cajviewer mac版 编辑:程序博客网 时间:2024/06/05 06:29
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.
Each number in C may only be used once in the combination.
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 10,1,2,7,6,1,5
and target 8
,
A solution set is: [1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]
思路:回溯算法,注意跳过相同元素。
import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class Solution {public List<List<Integer>> combinationSum2(int[] candidates, int target) {List<List<Integer>> result = new ArrayList<List<Integer>>();List<Integer> current = new ArrayList<Integer>();Arrays.sort(candidates);solve(candidates, target, 0, current, result);return result;}public void solve(int[] candidates, int target, int index, List<Integer> current, List<List<Integer>> result) {if (target == 0) {List<Integer> tmp = new ArrayList<Integer>(current);result.add(tmp);return;}for (int i = index; i < candidates.length; i++) {if (target < candidates[i]) {return;}current.add(candidates[i]);solve(candidates, target - candidates[i], i + 1, current, result);current.remove(current.size() - 1);while(i<(candidates.length-1)&&candidates[i]==candidates[i+1]){ i++; }}}}
1 0
- [Leetcode] Combination Sum II (Java)
- [LeetCode][Java] Combination Sum II
- LeetCode : Combination Sum II [java]
- 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
- 300. Longest Increasing Subsequence
- DEDE可不可以添加两个编辑器
- document.onreadystatechange |||| document.readyState == \"complete\"
- 《美国队长》性感身材是如何练成的?
- JavaScript For 循环
- LeetCode : Combination Sum II [java]
- Android生成随机数
- JS中window.showModalDialog()详解
- 文本框默认提示 placeholder
- 字符串方法,和数组常用方法
- JavaScript label标签
- Notification 使用详解(很全)
- 能在一台电脑上装好系统,然后把硬盘换到另外一台电脑上用吗?
- 第八章 2