11. 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 and n is at least 2.

 

此题用two pointer来做，用sum来保存容积，两个pointer中，高度相对较小的往中间移，代码如下：

p.p1 { margin: 0.0px 0.0px 0.0px 0.0px; font: 12.0px "Helvetica Neue"; color: #454545 }

public class Solution {

    public int maxArea(int[] height) {

        int left = 0;

        int right = height.length-1;

        int sum=-1;

        while(left<right){

            sum = Math.max(sum,(right-left)*Math.min(height[left],height[right]));

            if(height[left]<height[right]){

                left++;

            }else{

                right--;

            }

        }

        return sum;

    }

}