refactor 453

fishercoder1534 · fishercoder1534 · commit cba06706c9e0 · 2019-04-15T07:46:13.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_453.java b/src/main/java/com/fishercoder/solutions/_453.java
@@ -20,27 +20,26 @@ Only three moves are needed (remember each move increments two elements):
  [1,2,3]  =>  [2,3,3]  =>  [3,4,3]  =>  [4,4,4]*/
 
 public class _453 {
-    /**Looked at this solution: https://discuss.leetcode.com/topic/66557/java-o-n-solution-short
-     * i.e. Add 1 to n-1 elements basically equals to subtracting 1 from one element. So the easiest way
-     * to make all elements in this array equal is to make all of them equal to the minimum element.*/
-    public static int minMoves(int[] nums) {
-        if (nums.length == 0) {
-            return 0;
+    public static class Solution1 {
+        /**
+         * Credit: https://discuss.leetcode.com/topic/66557/java-o-n-solution-short
+         * i.e. Add 1 to n-1 elements basically equals to subtracting 1 from one element. So the easiest way
+         * to make all elements in this array equal is to make all of them equal to the minimum element.
+         */
+        public int minMoves(int[] nums) {
+            if (nums.length == 0) {
+                return 0;
+            }
+            int min = nums[0];
+            for (int n : nums) {
+                min = Math.min(min, n);
+            }
+            int res = 0;
+            for (int n : nums) {
+                res += n - min;
+            }
+            return res;
         }
-        int min = nums[0];
-        for (int n : nums) {
-            min = Math.min(min, n);
-        }
-        int res = 0;
-        for (int n : nums) {
-            res += n - min;
-        }
-        return res;
-    }
-
-    public static void main(String... args) {
-        int[] nums = new int[]{1, 2, 3};
-        System.out.println(minMoves(nums));
     }
 
 }
diff --git a/src/test/java/com/fishercoder/_453Test.java b/src/test/java/com/fishercoder/_453Test.java
@@ -0,0 +1,23 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._453;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.Assert.assertEquals;
+
+
+public class _453Test {
+    private static _453.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _453.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(3, solution1.minMoves(new int[]{1, 2, 3}));
+    }
+
+}
