Leetcode Container With Most Water

最新推荐文章于 2019-06-15 23:40:00 发布

原创最新推荐文章于 2019-06-15 23:40:00 发布 · 172 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 同时被 2 个专栏收录

262 篇文章

订阅专栏

Leetcode 重启

149 篇文章

订阅专栏

本文介绍了一种寻找能盛最多水的两个垂直线的算法。给定一系列非负整数，每个整数代表坐标上的高度，算法的目标是在这些线中找到两根线，这两根线与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.

Difficulty: Medium

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