11. Container With Most Water

最新推荐文章于 2025-08-08 21:26:37 发布

SnailRunFast

最新推荐文章于 2025-08-08 21:26:37 发布

阅读量196

点赞数

CC 4.0 BY-SA版权

分类专栏： Leet Code 文章标签： leetcode Container With Most

本文链接：https://blog.youkuaiyun.com/snailrunfast/article/details/65936004

Leet Code 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种寻找能盛最多水的两个垂直线的算法。该算法从两端开始向中间移动，记录每次比较的最大面积，适用于至少两条垂直线的情况。

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

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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:

Tips:

from two ends to middle, and record the max area for each comparing.

Java Code:

public class Solution {
    public int maxArea(int[] height) {
        int left = 0;
        int right = height.length - 1;
        int maxArea = 0;
        while (left < right) {
            int length = right - left;
            int higher = height[left] < height[right] ? height[left++] : height[right--];

            maxArea = Math.max(maxArea, length * higher);
        }

        return maxArea; 
    }
}