refactor 628

Author: fishercoder1534

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

@@ -20,29 +20,23 @@
  */
 public class _628 {
 
-    public int maximumProduct(int[] nums) {
-        Arrays.sort(nums);
-        int product = 1;
-        if (nums.length >= 3) {
-            for (int i = nums.length - 1; i >= nums.length - 3; i--) {
-                product *= nums[i];
-            }
-            int anotherProduct = nums[0] * nums
-                    [1] * nums[nums.length - 1];
-            product = Math.max(product, anotherProduct);
-        } else {
-            for (int i = 0; i < nums.length; i++) {
-                product *= nums[i];
+    public static class Solution1 {
+        public int maximumProduct(int[] nums) {
+            Arrays.sort(nums);
+            int product = 1;
+            if (nums.length >= 3) {
+                for (int i = nums.length - 1; i >= nums.length - 3; i--) {
+                    product *= nums[i];
+                }
+                int anotherProduct = nums[0] * nums
+                        [1] * nums[nums.length - 1];
+                product = Math.max(product, anotherProduct);
+            } else {
+                for (int i = 0; i < nums.length; i++) {
+                    product *= nums[i];
+                }
             }
+            return product;
         }
-        return product;
-    }
-
-    public static void main(String... args) {
-        _628 test = new _628();
-//        int[] nums = new int[]{1,2,3};
-//        int[] nums = new int[]{1,2,3,4};
-        int[] nums = new int[]{-4, -3, -2, -1, 60};
-        System.out.println(test.maximumProduct(nums));
     }
 }

src/test/java/com/fishercoder/_628Test.java

@@ -0,0 +1,36 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._628;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _628Test {
+    private static _628.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _628.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{1, 2, 3};
+        assertEquals(6, solution1.maximumProduct(nums));
+    }
+
+    @Test
+    public void test2() {
+        nums = new int[]{1, 2, 3, 4};
+        assertEquals(24, solution1.maximumProduct(nums));
+    }
+
+    @Test
+    public void test3() {
+        nums = new int[]{-4, -3, -2, -1, 60};
+        assertEquals(720, solution1.maximumProduct(nums));
+    }
+
+}