# Leetcode 11 - Container with most water

`Note:`

- My intuition is to use
`double pointers`

but how we should determine to move`left`

or`right`

pointer? - No matter which we move,
`W`

will be smaller. - To at least not make our next container smaller, we have to preserve the
`higher`

L. So, we should move the smaller pointer who has a`shorter L`

. - This can be proved by math, but we don’t bother to.

`Question:`

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.

`Example:`

1 | Input: height = [1,8,6,2,5,4,8,3,7] |

`Code:`

`Double pointers O(n)`

1 | /** |