Container With Most Water

最新推荐文章于 2019-11-06 10:22:53 发布

chsun_1123

最新推荐文章于 2019-11-06 10:22:53 发布

阅读量163

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/chsun_1123/article/details/51423604

版权

Leetcode 专栏收录该内容

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

Subscribe to see which companies asked this question

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

贪心的思想：

包含水的多少和两个因素有关，一个是x轴方向的长度，另外一个是y轴方向两条线的最低高度。初始两个指针，指向数组的首尾两端i=0,j=height.size()-1，这个时候在x轴方向的长度j-i为最大长度，比较height[i]和height[j]的长度，最短的那个长度和(j-i)的乘积就是包含水的量。当height[i]<height[j]的时候++i后的值可以期待height[i]比之前的height[i-1]大，从而弥补j-i的缩小，寄希望获得更大的包含水的容量值。