leetcode - Container With Most Water

最新推荐文章于 2021-04-18 11:59:36 发布

AkibaTakuya

最新推荐文章于 2021-04-18 11:59:36 发布

阅读量437

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/AkibaTakuya/article/details/40455535

版权

leetcode 专栏收录该内容

155 篇文章 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.

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