Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit 7e70435

Browse files
refactor 216
1 parent 706b18d commit 7e70435

File tree

1 file changed

+0
-14
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-14
lines changed

src/main/java/com/fishercoder/solutions/_216.java

Lines changed: 0 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -3,20 +3,6 @@
33
import java.util.ArrayList;
44
import java.util.List;
55

6-
/**
7-
* 216. Combination Sum III
8-
*
9-
* Find all possible combinations of k numbers that add up to a number n,
10-
* given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.
11-
12-
Example 1:
13-
Input: k = 3, n = 7
14-
Output: [[1,2,4]]
15-
16-
Example 2:
17-
Input: k = 3, n = 9
18-
Output: [[1,2,6], [1,3,5], [2,3,4]]
19-
*/
206
public class _216 {
217

228
public static class Solution1 {

0 commit comments

Comments
 (0)