LeetCode 0011 - Container With Most Water

Reck Zhang

发布于 2021-08-11 10:18:32

1320

发布于 2021-08-11 10:18:32

文章被收录于专栏：Reck Zhang

Container With Most Water

Desicription

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.

Solution

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

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-09，如有侵权请联系 cloudcommunity@tencent.com 删除

container