Leetcode 11. Container With Most Water

原题链接:https://leetcode.com/problems/container-with-most-water/description/

描述:

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:

本题的关键在于如何删减不必要的计算,首先我们设置两个标签left和right分别指向数组的头尾,那么此时能得到的最大容器必然是首尾值得最小值乘以数组长度-1,然后比较首尾值的大小,如果左边的值小于右边的值,那么以左边开始的其他容器一定都是比当前计算的值小的,因此可以将left++,相反,如果左边的值大于右边的值,那么以右边结尾的其他容器也一定是比当前值小,因此将right–,而当两者相等时,则是left和right都要变化,具体代码如下:

int maxArea(vector<int>& height) {
    int len = height.size();
    int left = 0, right = len - 1;
    int max0 = 0;
    while(left < right) {
        int l = height[left];
        int r = height[right];
        max0 = max(min(l,r) * (right - left), max0);
        if (l < r) left++;
        else if (l > r) right--;
        else left++, right--;
    }
    return max0;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u013898524/article/details/79464683
个人分类: c++ 每日一题
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭
关闭