11. Container With Most Water 双指针问题

最新推荐文章于 2024-10-29 13:54:07 发布

yuccess

最新推荐文章于 2024-10-29 13:54:07 发布

阅读量303

点赞数

CC 4.0 BY-SA版权

分类专栏：双指针文章标签：双指针

本文链接：https://blog.youkuaiyun.com/djgjmtdmjt/article/details/54016271

双指针专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一种寻找能盛最多水的两个垂直线的算法。给定一系列非负整数，每个整数代表坐标轴上的高度，算法的目标是找出两个线段与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 and n is at least 2.

class Solution {
public:
    int maxArea(vector<int>& height) {
    int water = 0;
    int i = 0, j = height.size() - 1;
    while (i < j) {
        int h = min(height[i], height[j]);
        water = max(water, (j - i) * h);
        while (height[i] <= h && i < j) i++;
        while (height[j] <= h && i < j) j--;//巧妙， 如果height[j] > height[i] 这句话不执行
    }
    return water;
}
};