LeetCode - Container With Most Water

https://leetcode.com/problems/container-with-most-water/

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.
这道题跟trapping rain water那道题是差不多的，能装的水限制于两边比较小的那个bar，因此从两边开始扫描，两边比较小的那个往中间移，然后持续更新可以获得的最大水量。
代码如下：

public int maxArea(int[] height) {
int volumn = Integer.MIN_VALUE;
int start = 0;
int end = height.length-1;
while(start<end){
int current = (end-start)*Math.min(height[start], height[end]);
if(current>volumn) volumn = current;
if(height[start]<height[end]) start++;
else end--;
}
return volumn;
}

时间复杂度O(n)，空间复杂度O(1)