# leetcode刷题笔记(Golang)--11. Container With Most Water

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.

image

Example:
Input: [1,8,6,2,5,4,8,3,7]
Output: 49

``````func maxArea(height []int) int {
res := 0
l := 0
r := len(height) - 1
for l < r {
h := height[l]
if height[l] > height[r] {
h = height[r]
}
if res < h*(r-l) {
res = h * (r - l)
}

if height[l] < height[r] {
l++
} else {
r--
}
}
return res
}
``````

0 回复

• 请尽量让自己的回复能够对别人有帮助
• 支持 Markdown 格式, **粗体**、~~删除线~~、``单行代码``
• 支持 @ 本站用户；支持表情（输入 : 提示），见 Emoji cheat sheet
• 图片支持拖拽、截图粘贴等方式上传

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.

image

Example:
Input: [1,8,6,2,5,4,8,3,7]
Output: 49

``````func maxArea(height []int) int {
res := 0
l := 0
r := len(height) - 1
for l < r {
h := height[l]
if height[l] > height[r] {
h = height[r]
}
if res < h*(r-l) {
res = h * (r - l)
}

if height[l] < height[r] {
l++
} else {
r--
}
}
return res
}
``````