[N-0] refactor 11

Author: fishercoder1534

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

@@ -12,24 +12,23 @@
  */
 public class _11 {
 
-    public int maxArea(int[] height) {
-        int max = Integer.MIN_VALUE;
-        int len = height.length;
-        int i = 0;
-        int j = len - 1;
-        while (i < j) {
-            if (Math.min(height[i], height[j]) * (j - i) > max) {
-                max = Math.min(height[i], height[j]) * (j - i);
-            }
-            if (height[i] <= height[j]) {
-                // we need to find the shorter one,
-                // then calculate its area
-                i++;
-            } else {
-                j--;
+    public static class Solution1 {
+        public int maxArea(int[] height) {
+            int max = 0;
+            int i = 0;
+            int j = height.length - 1;
+            while (i < j) {
+                max = Math.max(Math.min(height[i], height[j]) * (j - i), max);
+                if (height[i] <= height[j]) {
+                    // we need to find the shorter one,
+                    // then calculate its area
+                    i++;
+                } else {
+                    j--;
+                }
             }
+            return max;
         }
-        return max;
     }
 
 }

src/test/java/com/fishercoder/_11Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._11;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.Assert.assertEquals;
+
+public class _11Test {
+    private static _11.Solution1 solution1;
+    private static int[] height;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _11.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        height = new int[]{1, 1};
+        assertEquals(1, solution1.maxArea(height));
+    }
+
+}