leetcode 11. Container With Most Water

最新推荐文章于 2024-10-29 13:54:07 发布

XiaoM将故事

最新推荐文章于 2024-10-29 13:54:07 发布

阅读量188

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： Java leetcode

本文链接：https://blog.youkuaiyun.com/Lutte_/article/details/78869340

LeetCode 专栏收录该内容

39 篇文章

订阅专栏

本文介绍了一种寻找能容纳最多水的两个垂直线的高效算法。该算法通过双指针技术，从两端向中间逼近，逐步优化解决方案。适用于至少包含两条线的数组，确保了在O(n)的时间复杂度内找到最优解。

摘要生成于 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.

解析

class Solution {
    public int maxArea(int[] height) {
        int left = 0, right = height.length - 1;
        int maxArea = 0;
        while (left < right) {
            int tmpArea = Math.min(height[left], height[right]) * (right - left);
            maxArea = Math.max(maxArea, tmpArea);
            //左边限制的容量
            if (height[left] < height[right]) {
                left++;
            } else {
                right--;
            }
        }
        return maxArea;
    }
}