# LeetCode_011: Container With Most Water

这道题的重点是对双指针过程的分析，典型的双指针类型题目，博主的代码速度为16ms，战胜90%的答题者，思路比较一般，不过还是分享一下。

### 题目

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.