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

原题链接11. Container With Most Water
Given n non-negative integers a₁, a₂, ..., a_n , where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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
}

有疑问加站长微信联系（非本文作者）