Skip to content

Commit d2e7905

Browse files
author
liwentian
committed
combination sum ii
1 parent d278a4b commit d2e7905

4 files changed

Lines changed: 54 additions & 3 deletions

File tree

‎Facebook.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -47,4 +47,5 @@ Facebook题目列表(24)
4747
|79|[Word Search](https://leetcode.com/problems/word-search/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/WordSearch.java)|
4848
|398|[Random Pick Index](https://leetcode.com/problems/random-pick-index/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/RandomPickIndex.java)|
4949
|128|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/LongestConsecutiveSequence.java)|
50-
|39|[Combination Sum](https://leetcode.com/problems/combination-sum/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/CombinationSum.java)|
50+
|39|[Combination Sum](https://leetcode.com/problems/combination-sum/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/CombinationSum.java)|
51+
|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/CombinationSumII.java)|

‎Leetcodes.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -15,6 +15,7 @@
1515
|23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MergeKSortedList.java)|70|
1616
|38|[Count and Say](https://leetcode.com/problems/count-and-say/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/CountAndSay.java)|80|
1717
|39|[Combination Sum](https://leetcode.com/problems/combination-sum/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/CombinationSum.java)|70|
18+
|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/CombinationSumII.java)|70|
1819
|42|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/TrappingRainWater.java)|95|
1920
|43|[Multiply Strings](https://leetcode.com/problems/multiply-strings/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/MultiplyStrings.java)|80|
2021
|44|[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)| [Java](https://github.com/dingjikerbo/leetcode/blob/master/solution/src/main/java/com/inuker/solution/WildcardMatching.java)|60|
Lines changed: 42 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,42 @@
1+
package com.inuker.solution;
2+
3+
import java.util.Arrays;
4+
import java.util.LinkedList;
5+
import java.util.List;
6+
7+
/**
8+
* Created by dingjikerbo on 16/11/22.
9+
*/
10+
11+
public class CombinationSumII {
12+
13+
public List<List<Integer>> combinationSum2(int[] candidates, int target) {
14+
List<List<Integer>> result = new LinkedList<List<Integer>>();
15+
Arrays.sort(candidates);
16+
dfs(candidates, 0, target, result, new LinkedList<Integer>());
17+
return result;
18+
}
19+
20+
private void dfs(int[] candidates, int start, int target, List<List<Integer>> result, List<Integer> path) {
21+
if (target < 0) {
22+
return;
23+
}
24+
25+
if (target == 0) {
26+
result.add(new LinkedList<Integer>(path));
27+
return;
28+
}
29+
30+
for (int i = start; i < candidates.length; i++) {
31+
if (i > start && candidates[i] == candidates[i - 1]) {
32+
continue;
33+
}
34+
35+
path.add(candidates[i]);
36+
37+
// 关键是这里变成i + 1
38+
dfs(candidates, i + 1, target - candidates[i], result, path);
39+
path.remove(path.size() - 1);
40+
}
41+
}
42+
}

‎solution/src/main/java/com/inuker/solution/Main.java‎

Lines changed: 9 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,14 @@
88
public class Main {
99

1010
public static void main(String[] args) {
11-
String s = new SimplifyPath().simplifyPath("/..");
12-
System.out.println(s);
11+
List<List<Integer>> result = new CombinationSumII().combinationSum2(new int[] {
12+
10,1,2,7,6,1,5
13+
},8);
14+
for (List<Integer> list : result) {
15+
for (Integer n : list) {
16+
System.out.print(n + " ");
17+
}
18+
System.out.println();
19+
}
1320
}
1421
}

0 commit comments

Comments
 (0)