You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store. (java)

Author: Radhika1324

maxarea.java

@@ -0,0 +1,21 @@
+class maxarea {
+    public int maxArea(int[] height) {
+        int m = 0;
+        int left = 0;
+        int right = height.length - 1;
+        while (left < right) {
+            int h = Math.min(height[left], height[right]);
+            int w = right - left;
+            int area = h * w;
+            m = Math.max(m, area);
+
+            if (height[left] < height[right]) {
+                left++;
+            } else {
+                right--;
+            }
+        }
+        return m;
+
+    }
+}