leetcode 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.

 

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

 

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

中文描述：

给出一个数列，找出数列构成的最大面积。

解题思路：

设置双指针，分别从头尾开始遍历，如果头大于尾部，则尾部指针--，反之头部指针++，每步求出最大值，返回全局最大值。

代码（java）：

class Solution {
    public int maxArea(int[] height) {
        if(height.length<=1)return 0;
        int max=0;
        int left=0,right=height.length-1;
        while(left<right){
            if(height[left]<height[right]){
                max=Math.max(max,(right-left)*height[left]);
                left++;
            }
            else{
                max=Math.max(max,(right-left)*height[right]);
                right--;
            }
        }
        return max;
    }
}