Container With Most Water

最新推荐文章于 2024-08-28 08:50:09 发布

原创最新推荐文章于 2024-08-28 08:50:09 发布 · 421 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode_Java 专栏收录该内容

121 篇文章

订阅专栏

本文介绍了一种求解垂直线形成的容器中最多水量的方法，通过双指针技巧优化算法效率，实现对任意给定非负整数数组的快速处理。

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.

这道题目要注意不能slant the container，也就是是最矮的line 觉得高度。

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