Container With Most Water

cgdong2014

于 2015-01-20 01:42:08 发布

阅读量235

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/cgdong2014/article/details/42903103

版权

LeetCode 专栏收录该内容

139 篇文章 0 订阅

订阅专栏

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.

思路：暴力求解，每次取最大面积

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