refactor 216

fishercoder1534 · fishercoder1534 · commit f41c3759e20f · 2018-09-24T07:23:51.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_216.java b/src/main/java/com/fishercoder/solutions/_216.java
@@ -9,40 +9,34 @@
  * Find all possible combinations of k numbers that add up to a number n,
  * given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.
 
-
  Example 1:
-
  Input: k = 3, n = 7
-
- Output:
-
- [[1,2,4]]
+ Output: [[1,2,4]]
 
  Example 2:
-
  Input: k = 3, n = 9
-
- Output:
-
- [[1,2,6], [1,3,5], [2,3,4]]*/
+ Output: [[1,2,6], [1,3,5], [2,3,4]]
+ */
 public class _216 {
 
-    public List<List<Integer>> combinationSum3(int k, int n) {
-        List<List<Integer>> result = new ArrayList();
-        int[] nums = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9};
-        backtracking(k, n, nums, 0, new ArrayList(), result);
-        return result;
-    }
+    public static class Solution1 {
+        public List<List<Integer>> combinationSum3(int k, int n) {
+            List<List<Integer>> result = new ArrayList();
+            int[] nums = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9};
+            backtracking(k, n, nums, 0, new ArrayList(), result);
+            return result;
+        }
 
-    void backtracking(int k, int n, int[] nums, int start, List<Integer> curr, List<List<Integer>> result) {
-        if (n > 0) {
-            for (int i = start; i < nums.length; i++) {
-                curr.add(nums[i]);
-                backtracking(k, n - nums[i], nums, i + 1, curr, result);
-                curr.remove(curr.size() - 1);
+        void backtracking(int k, int n, int[] nums, int start, List<Integer> curr, List<List<Integer>> result) {
+            if (n > 0) {
+                for (int i = start; i < nums.length; i++) {
+                    curr.add(nums[i]);
+                    backtracking(k, n - nums[i], nums, i + 1, curr, result);
+                    curr.remove(curr.size() - 1);
+                }
+            } else if (n == 0 && curr.size() == k) {
+                result.add(new ArrayList(curr));
             }
-        } else if (n == 0 && curr.size() == k) {
-            result.add(new ArrayList(curr));
         }
     }
 }
