leetcode - 11.Container With Most Water

最新推荐文章于 2022-07-23 19:08:46 发布

xiedacon

最新推荐文章于 2022-07-23 19:08:46 发布

阅读量166

点赞数

分类专栏： leetcode题集文章标签： leetcode

本文链接：https://blog.csdn.net/qq_27350929/article/details/59634947

版权

leetcode题集专栏收录该内容

96 篇文章 0 订阅

订阅专栏

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 int maxArea(int[] height) {
        int left = 0;
        int right = height.length - 1;
        int maxArea = 0;
        int leftHeight, rightHeight;

        while (left < right) {
            leftHeight = height[left];
            rightHeight = height[right];

            maxArea = Math.max(maxArea, Math.min(leftHeight, rightHeight) * (right - left));

            if (leftHeight < rightHeight) {
                left++;
            } else {
                right--;
            }
        }

        return maxArea;
    }