0011-container-with-most-water.adoc

11. Container With Most Water

{leetcode}/problems/container-with-most-water/[LeetCode - 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.

[.small]#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

解题分析

双指针左右夹逼，保留高个，移动低个。

这里有个疑问，不考虑中间

一刷

link:{sourcedir}/_0011_ContainerWithMostWater.java[role=include]

二刷

link:{sourcedir}/_0011_ContainerWithMostWater_2.java[role=include]

三刷

link:{sourcedir}/_0011_ContainerWithMostWater_3.java[role=include]

参考资料

1. 盛最多水的容器 - 盛最多水的容器 - 力扣（LeetCode）