[N-0] refactor 216

fishercoder1534 · fishercoder1534 · commit 840ceaea10a6 · 2017-10-29T22:07:12.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_216.java b/src/main/java/com/fishercoder/solutions/_216.java
@@ -38,13 +38,10 @@ void backtracking(int k, int n, int[] nums, int start, List<Integer> curr, List<
         if (n > 0) {
             for (int i = start; i < nums.length; i++) {
                 curr.add(nums[i]);
-                /** it needs to be a unique set of numbers, so we need to set it
-                 as i+1 here: each number is used only once in this array: [1,2,3,4,5,6,7,8,9]*/
                 backtracking(k, n - nums[i], nums, i + 1, curr, result);
                 curr.remove(curr.size() - 1);
             }
         } else if (n == 0 && curr.size() == k) {
-            //this is the major difference here: check size of curr list is of k before adding it
             result.add(new ArrayList(curr));
         }
     }

Original file line number	Diff line number	Diff line change
`@@ -38,13 +38,10 @@ void backtracking(int k, int n, int[] nums, int start, List<Integer> curr, List<`
`38`	`38`	`if (n > 0) {`
`39`	`39`	`for (int i = start; i < nums.length; i++) {`
`40`	`40`	`curr.add(nums[i]);`
`41`		`- /** it needs to be a unique set of numbers, so we need to set it`
`42`		`- as i+1 here: each number is used only once in this array: [1,2,3,4,5,6,7,8,9]*/`
`43`	`41`	`backtracking(k, n - nums[i], nums, i + 1, curr, result);`
`44`	`42`	`curr.remove(curr.size() - 1);`
`45`	`43`	`}`
`46`	`44`	`} else if (n == 0 && curr.size() == k) {`
`47`		`- //this is the major difference here: check size of curr list is of k before adding it`
`48`	`45`	`result.add(new ArrayList(curr));`
`49`	`46`	`}`
`50`	`47`	`}`