refactor 473

Author: fishercoder1534

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

@@ -27,9 +27,11 @@
  */
 public class _473 {
 
-    /**Partially inspired by: https://discuss.leetcode.com/topic/72107/java-dfs-solution-with-explanation/2*/
-
-    /**One hidden requirement: you'll have to use up all of the given matchsticks, nothing could be left behind.*/
+    public static class Solution1 {
+    /**
+     * Partially inspired by: https://discuss.leetcode.com/topic/72107/java-dfs-solution-with-explanation/2
+     * One hidden requirement: you'll have to use up all of the given matchsticks, nothing could be left behind.
+     */
     public boolean makesquare(int[] nums) {
         if (nums == null || nums.length < 4) {
             return false;
@@ -47,35 +49,36 @@ public boolean makesquare(int[] nums) {
         return dfs(nums, new int[4], 0, sum / 4);
     }
 
-    private boolean dfs(int[] nums, int[] sums, int index, int target) {
-        if (index == nums.length) {
-            if (sums[0] == target && sums[1] == target && sums[2] == target) {
-                return true;
-            }
-            return false;
-        }
-        for (int i = 0; i < 4; i++) {
-            if (sums[i] + nums[index] > target) {
-                continue;
+        private boolean dfs(int[] nums, int[] sums, int index, int target) {
+            if (index == nums.length) {
+                if (sums[0] == target && sums[1] == target && sums[2] == target) {
+                    return true;
+                }
+                return false;
             }
-            sums[i] += nums[index];
-            if (dfs(nums, sums, index + 1, target)) {
-                return true;
+            for (int i = 0; i < 4; i++) {
+                if (sums[i] + nums[index] > target) {
+                    continue;
+                }
+                sums[i] += nums[index];
+                if (dfs(nums, sums, index + 1, target)) {
+                    return true;
+                }
+                sums[i] -= nums[index];
             }
-            sums[i] -= nums[index];
+            return false;
         }
-        return false;
-    }
 
-    private void reverse(int[] nums) {
-        int left = 0;
-        int right = nums.length - 1;
-        while (left < right) {
-            int tmp = nums[left];
-            nums[left] = nums[right];
-            nums[right] = tmp;
-            left++;
-            right--;
+        private void reverse(int[] nums) {
+            int left = 0;
+            int right = nums.length - 1;
+            while (left < right) {
+                int tmp = nums[left];
+                nums[left] = nums[right];
+                nums[right] = tmp;
+                left++;
+                right--;
+            }
         }
     }
 

src/test/java/com/fishercoder/_473Test.java

@@ -10,17 +10,17 @@
  * Created by stevesun on 5/30/17.
  */
 public class _473Test {
-    private static _473 test;
+    private static _473.Solution1 solution1;
     private static int[] nums;
 
     @BeforeClass
     public static void setup() {
-        test = new _473();
+        solution1 = new _473.Solution1();
     }
 
     @Test
     public void test1() {
         nums = new int[]{1, 1, 2, 2, 2};
-        assertEquals(true, test.makesquare(nums));
+        assertEquals(true, solution1.makesquare(nums));
     }
 }