- My intuition is to use
double pointersbut how we should determine to move
- No matter which we move,
Wwill be smaller.
- To at least not make our next container smaller, we have to preserve the
higherL. So, we should move the smaller pointer who has a
- This can be proved by math, but we don’t bother to.
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 the line i is at
(i, ai) and
(i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.
Notice that you may not slant the container.
Input: height = [1,8,6,2,5,4,8,3,7]
Double pointers O(n)