[LeetCode] 022: Container With Most Water

最新推荐文章于 2022-07-23 19:08:46 发布

1.02^365的成长裂变

最新推荐文章于 2022-07-23 19:08:46 发布

阅读量3.5k

点赞数

分类专栏： LeetCode2

本文链接：https://blog.csdn.net/raojunyang/article/details/77925125

版权

LeetCode2 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

[Problem]

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.

[Solution]

class Solution {
public:
    int maxArea(vector<int> &height) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int i = 0, j = height.size()-1, value = 0;
        
        // find max area
        while(i < j){
            int area = (j-i) * min(height[i], height[j]);
            value = max(value, area);
            
            // move forward
            if(height[i] < height[j]){
                i++;
            }
            else{
                j--;
            }
        }
        return value;
    }
};