Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.
Note: You may not slant the container and n is at least 2.
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:
Input: [1,8,6,2,5,4,8,3,7]
Output: 49
func maxArea(height []int) int {
left, right := 0, len(height)-1
var result int = 0
for left < right {
result = max(result, (right-left)*min(height[left], height[right]))
if height[left] < height[right] {
left++
} else {
right--
}
}
return result
}
func min(x int, y int) int {
if x < y {
return x
} else {
return y
}
}
func max(x int, y int) int {
if x < y {
return y
} else {
return x
}
}