[LintCode] Container With Most Water 装最多水的容器

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate <code>(i, ai)</code>. n vertical lines are drawn such that the two endpoints of line i is at <code>(i, ai)</code> and <code>(i, 0)</code>. Find two lines, which together with x-axis forms a container, such that the container contains the most water.

You may not slant the container.

Have you met this question in a real interview? 

Yes

Example

Given <code>[1,3,2]</code>, the max area of the container is <code>2</code>.

解法一：

解法二：