Leetcode100: Container With Most Water

最新推荐文章于 2025-09-06 17:14:26 发布

银色子弹lx

最新推荐文章于 2025-09-06 17:14:26 发布

阅读量262

点赞数

CC 4.0 BY-SA版权

分类专栏： c++ leetcode 文章标签： leetcode algorithm

本文链接：https://blog.youkuaiyun.com/u013089961/article/details/49180987

c++ 同时被 2 个专栏收录

244 篇文章

订阅专栏

leetcode

243 篇文章

订阅专栏

本文介绍了一种寻找数组中能够形成最大盛水量的两个元素的高效算法。通过双指针技术，逐步移动较短边界，实现O(n)时间内解决问题。

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.

题意：有一个高度数组，求数组中任意高度间盛水的最大量，高度间的距离与较低高度乘积即为盛水的容量。

class Solution {
public:
    int maxArea(vector<int>& height) {
        int n = height.size();
        int l = 0; 
        int r = n-1;
        int res = 0;
        while(l<r)
        {
            res = max(res, min(height[l],height[r])*(r-l));
            height[l]<height[r]?l++:r--;
        }
        return res;
    }
};