### 题目

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.

### 解题思路

使用两个指针，左右同时向中间扫描

left < right -> left++

left > right -> right–

记录每一次的容积

### 代码

1 | public int maxArea(int[] height) { |