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.
Example 2:
Input: height = [1,1]
Output: 1
class Solution {
func maxArea(_ height: [Int]) -> Int {
guard height.count > 1 else {
return 0
}
var left = 0
var right = height.count - 1
var area = 0
while left < right {
var h = 0
if height[left] < height[right] {
h = height[left]
left += 1
} else {
h = height[right]
right -= 1
}
area = max(area, (right - left + 1) * h)
}
return area
}
}