11. Container With Most Water

最新推荐文章于 2024-01-04 13:57:00 发布

原创最新推荐文章于 2024-01-04 13:57:00 发布 · 465 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetCode

LeetCode 专栏收录该内容

21 篇文章

订阅专栏

本文介绍了一种寻找能盛最多水的两条线段的算法。该算法使用双指针技术，从数组两端开始向中间搜索，通过比较每一对线段高度来确定能够形成的最大容器体积。适用于至少包含两个元素的数组。

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 class Solution {
    public int maxArea(int[] height) {
        int i = 0, j = height.length - 1;
        int max = 0;
        while(i < j) {
            max = Math.max(max, Math.min(height[i], height[j]) * (j - i));
            if (height[i] < height[j])
                i++;
            else 
                j--;
        }
        return max;
    }
}