LeetCode-Container With Most Water

最新推荐文章于 2020-08-23 15:53:30 发布

原创最新推荐文章于 2020-08-23 15:53:30 发布 · 617 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode

水题同时被 2 个专栏收录

30 篇文章

订阅专栏

LeetCode

6 篇文章

订阅专栏

本文介绍了一种寻找能容纳最多水的两个垂直线的算法。该算法通过比较两端的线段高度并逐步向内收缩来确定最大盛水量。具体实现为使用双指针法，从两侧向中间遍历，始终移动高度较低的指针。

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.

简单题，前后夹逼，哪一边板较短，就从哪一边往中间靠扰，靠扰过程中不断取面积最大值。

AC代码

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