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.

Solution

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

container with most water

近期文章

近期评论

标签

热门

文章归档

分类目录

功能