LeetCode-11-盛最多水的容器-双指针

原创于 2021-01-13 23:32:11 发布 · 133 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

算法刷刷更健康专栏收录该内容

23 篇文章

订阅专栏

博客给出LeetCode上“盛最多水的容器”题目及对应题解链接。题目为“11 - 盛最多水的容器”，链接为https://leetcode-cn.com/problems/container-with-most-water/ ，题解链接为https://leetcode-cn.com/problems/container-with-most-water/solution/on-shuang-zhi-zhen-jie-fa-li-jie-zheng-que-xing-tu/ 。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

11-盛最多水的容器
https://leetcode-cn.com/problems/container-with-most-water/
在这里插入图片描述

题解

https://leetcode-cn.com/problems/container-with-most-water/solution/on-shuang-zhi-zhen-jie-fa-li-jie-zheng-que-xing-tu/

class Solution {
public:
    int maxArea(vector<int>& height) {
        int result = 0;
        int area = 0;
        int l = 0;
        int r = height.size() - 1;
        while (l < r) {
            // area = min(height[l], height[r]) * (l - r);
            // cout << r << endl;
            // cout << l << endl;
            // cout << height[r] << endl;
            // cout << height[l] << endl;
            area = min(height[l], height[r]) * (r - l);
            result = max(result, area);
            if (height[l] < height[r]) {
                l++;
            } else {
                // r--;
                r++;
            }
        }
        return result;
    }
};