solved using two pointers

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.

Notice that you may not slant the container.

 

Example 1:


Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Author: Gauranshgoel123

container-with-most-water.py

@@ -0,0 +1,18 @@
+class Solution(object):
+    def maxArea(self, height):
+        """
+        :type height: List[int]
+        :rtype: int
+        """
+        l=0
+        r=len(height)-1
+        max_area=0
+        while l < r :
+            area=(r-l)*min(height[r],height[l])
+            max_area=max(max_area,area)
+            if height[r] > height[l]:
+                l=l+1
+            else:
+                r=r-1
+        return max_area
+