[N-0] refactor 40

fishercoder1534 · fishercoder1534 · commit 67091d214171 · 2017-10-29T21:58:07.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_40.java b/src/main/java/com/fishercoder/solutions/_40.java
@@ -1,7 +1,5 @@
 package com.fishercoder.solutions;
 
-import com.fishercoder.common.utils.CommonUtils;
-
 import java.util.ArrayList;
 import java.util.Arrays;
 import java.util.List;
@@ -25,35 +23,28 @@ All numbers (including target) will be positive integers.
  */
 public class _40 {
 
-    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
-        List<List<Integer>> result = new ArrayList();
-        Arrays.sort(candidates);
-        backtracking(candidates, target, 0, new ArrayList(), result);
-        return result;
-    }
+    public static class Solution1 {
+        public List<List<Integer>> combinationSum2(int[] candidates, int target) {
+            List<List<Integer>> result = new ArrayList();
+            Arrays.sort(candidates);
+            backtracking(candidates, target, 0, new ArrayList(), result);
+            return result;
+        }
 
-    void backtracking(int[] candidates, int target, int start, List<Integer> curr, List<List<Integer>> result) {
-        if (target > 0) {
-            for (int i = start; i < candidates.length && target >= candidates[i]; i++) {
-                if (i > start && candidates[i] == candidates[i - 1]) {
-                    continue;//skip duplicates, this is one difference from Combination Sum I
+        void backtracking(int[] candidates, int target, int start, List<Integer> curr, List<List<Integer>> result) {
+            if (target > 0) {
+                for (int i = start; i < candidates.length && target >= candidates[i]; i++) {
+                    if (i > start && candidates[i] == candidates[i - 1]) {
+                        continue;//skip duplicates, this is one difference from Combination Sum I
+                    }
+                    curr.add(candidates[i]);
+                    backtracking(candidates, target - candidates[i], i + 1, curr, result);//i+1 is the other difference from Combination Sum I
+                    curr.remove(curr.size() - 1);
                 }
-                curr.add(candidates[i]);
-                backtracking(candidates, target - candidates[i], i + 1, curr, result);//i+1 is the other difference from Combination Sum I
-                curr.remove(curr.size() - 1);
+            } else if (target == 0) {
+                result.add(new ArrayList(curr));
             }
-        } else if (target == 0) {
-            List<Integer> temp = new ArrayList(curr);
-            result.add(temp);
         }
     }
 
-    public static void main(String... args) {
-        _40 test = new _40();
-        int[] candidates = new int[]{10, 1, 2, 7, 6, 1, 5};
-        int target = 8;
-        List<List<Integer>> result = test.combinationSum2(candidates, target);
-        CommonUtils.printListList(result);
-    }
-
-}
+}
