Leetcode11（Java）

最新推荐文章于 2024-06-15 15:05:09 发布

catttbao

最新推荐文章于 2024-06-15 15:05:09 发布

阅读量339

点赞数 2

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode java

本文链接：https://blog.youkuaiyun.com/catttbao/article/details/77056284

leetcode 专栏收录该内容

40 篇文章

订阅专栏

本文介绍了一种寻找能盛最多水的两个垂直线的算法。给定一系列非负整数，每个代表坐标上的高度，通过计算找出两线与x轴构成的最大容器体积。算法采用双指针法，从两端向中间逼近，确保高效找到答案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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