update 11

Author: fishercoder1534

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

@@ -2,23 +2,6 @@
 
 public class _11 {
     public static class Solution1 {
-        /*
-         * Time: O(n^2)
-         * This brute force solution is NOT accepted on LeetCode due to TLE.
-         */
-        public int maxArea(int[] height) {
-            int maxArea = 0;
-            for (int left = 0; left < height.length - 1; left++) {
-                for (int right = height.length - 1; left < right; right--) {
-                    int area = (right - left) * Math.min(height[left], height[right]);
-                    maxArea = Math.max(maxArea, area);
-                }
-            }
-            return maxArea;
-        }
-    }
-
-    public static class Solution2 {
         /*
          * Two pointer technique.
          * Well explained here: https://leetcode.com/problems/container-with-most-water/discuss/6100/Simple-and-clear-proofexplanation

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

@@ -8,21 +8,18 @@
 
 public class _11Test {
     private _11.Solution1 solution1;
-    private _11.Solution2 solution2;
     private static int[] height;
     private static int expected;
 
     @BeforeEach
     public void setup() {
         solution1 = new _11.Solution1();
-        solution2 = new _11.Solution2();
     }
 
     @Test
     public void test1() {
         height = new int[] {1, 1};
         expected = 1;
         assertEquals(expected, solution1.maxArea(height));
-        assertEquals(expected, solution2.maxArea(height));
     }
 }