Add unit tests for the "Container With Most Water" problem.

src/ContainerWithMostWater11.java → src/main/java/com/leetcode/medium/ContainerWithMostWater11.java

@@ -1,7 +1,11 @@
+// Tags: Two Pointers, Greedy
+package com.leetcode.medium;
+
 public class ContainerWithMostWater11 {
-    /*
-        Time Complexity: O(n)
-        Space Complexity: O(1)
+    /**
+     * Time Complexity: O(n)
+     * <p>
+     * Space Complexity: O(1)
      */
     public int maxArea(int[] height) {
         int l = 0;
@@ -18,9 +22,4 @@ public int maxArea(int[] height) {
         }
         return res;
     }
-
-    public static void main(String[] args) {
-        int[] height = new int[]{1, 8, 6, 2, 5, 4, 8, 3, 7};
-        System.out.println(new ContainerWithMostWater11().maxArea(height)); // 49
-    }
 }

src/test/java/com/leetcode/medium/ContainerWithMostWater11Test.java

@@ -0,0 +1,35 @@
+package com.leetcode.medium;
+
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class ContainerWithMostWater11Test {
+    private ContainerWithMostWater11 solution;
+
+    @BeforeEach
+    void setUp() {
+        solution = new ContainerWithMostWater11();
+    }
+
+    @Test
+    void testMaxArea_Example1() {
+        int[] height = {1, 8, 6, 2, 5, 4, 8, 3, 7};
+        int expected = 49;
+
+        int result = solution.maxArea(height);
+
+        assertEquals(expected, result);
+    }
+
+    @Test
+    void testMaxArea_Example2() {
+        int[] height = {1, 1};
+        int expected = 1;
+
+        int result = solution.maxArea(height);
+
+        assertEquals(expected, result);
+    }
+}