LeetCode 11. Container With Most Water(java)

最新推荐文章于 2022-07-23 19:08:46 发布

katrina95

最新推荐文章于 2022-07-23 19:08:46 发布

阅读量168

点赞数

分类专栏：计算机算法文章标签： java leetcode lines

本文链接：https://blog.csdn.net/katrina95/article/details/79060756

版权

计算机算法专栏收录该内容

221 篇文章 0 订阅

订阅专栏

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.

思路：由于只需要确定两个竖线的位置，求两个竖线之间的容量，因此，用双指针的想法，两端向中间逼近，每次逼近的方法是，如果左边竖线更高，就end–，如果右边竖线更高，就begin++。

public int maxArea(int[] height) {
        if (height.length <= 1) return 0;
        int begin = 0, end = height.length - 1, max = 0;
        while (begin < end) {
            int area = Math.min(height[begin], height[end]) * (end - begin);
            if (area > max) max = area;
            if (height[begin] > height[end]) {
                end--;
            } else {
                begin++;
            }
        }
        return max;
    }