chore: Leetcode

Author: itdar

src/main/java/algorithm_sites/leetcode2/LC_00011_ContainerWithMostWater.java

@@ -0,0 +1,25 @@
+package algorithm_sites.leetcode2;
+
+public class LC_00011_ContainerWithMostWater {
+
+    public int maxArea(int[] heights) {
+        int result = 0;
+
+        int front = 0;
+        int rear = heights.length-1;
+        while (front < rear) {
+            int width = rear - front;
+            int height = Math.min(heights[front], heights[rear]);
+            result = Math.max(result, width * height);
+
+            if (heights[front] > heights[rear]) {
+                --rear;
+            } else {
+                ++front;
+            }
+        }
+
+        return result;
+    }
+
+}

src/test/java/algorithm_sites/leetcode2/LC_00011_ContainerWithMostWaterTest.java

@@ -0,0 +1,29 @@
+package algorithm_sites.leetcode2;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+import org.junit.jupiter.api.Test;
+
+class LC_00011_ContainerWithMostWaterTest {
+
+    private LC_00011_ContainerWithMostWater lc = new LC_00011_ContainerWithMostWater();
+
+    @Test
+    void solutionTest1() {
+        int result = lc.maxArea(new int[]{1, 8, 6, 2, 5, 4, 8, 3, 7});
+        assertThat(result).isEqualTo(49);
+    }
+
+    @Test
+    void solutionTest2() {
+        int result = lc.maxArea(new int[]{1,1});
+        assertThat(result).isEqualTo(1);
+    }
+
+    @Test
+    void solutionTest3() {
+        int result = lc.maxArea(new int[]{2,3,10,5,7,8,9});
+        assertThat(result).isEqualTo(36);
+    }
+
+}