Container With Most Water

最新推荐文章于 2014-06-18 10:57:09 发布

shzxrt

最新推荐文章于 2014-06-18 10:57:09 发布

阅读量394

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/shzxrt/article/details/29356295

版权

leetcode 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

Container With Most Water

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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.

水题，就是从两边向中间计算，每次计算出一个area，在用一个maxarea在存储最大值，计算一次后，去掉值小的，移位运算。其实就是计算min(ai, aj) * (i - j)

int maxArea(vector<int> &height) {
        int high = (int)height.size() - 1;
        int low = 0;
        int maxarea = 0;
        while(low < high){
            maxarea = max(maxarea, (high - low) * min(height[low], height[high]));
            if(height[low] < height[high])
                low++;
            else high--;
        }
        return maxarea;
    }