leetcode-#11 Container With Most Water

最新推荐文章于 2022-03-29 21:43:55 发布

田园诗人之园

最新推荐文章于 2022-03-29 21:43:55 发布

阅读量183

点赞数

分类专栏： leetcode 文章标签： leetcode-#11 Container With Most Wa

本文链接：https://blog.csdn.net/u014100559/article/details/102468848

版权

leetcode 专栏收录该内容

120 篇文章 11 订阅

订阅专栏

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.

在这里插入图片描述

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/container-with-most-water
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

int maxArea(int* height, int heightSize){
    int left = 0, right = heightSize - 1;
    int maxVolume = 0;
    int currVolume = 0;

    while (right > left) {
        currVolume = ((height[left] > height[right])?height[right]:height[left]) * (right - left);
        maxVolume = (currVolume > maxVolume)?currVolume:maxVolume;
        
        if (height[left] > height[right])
        {
            right--;
        }
        else
        {
            left++;
        }
    }

    return maxVolume;
}