LintCode_383 Container With Most Water

最新推荐文章于 2020-05-15 13:26:45 发布

Bernini_buffalo

最新推荐文章于 2020-05-15 13:26:45 发布

阅读量289

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_31552435/article/details/52265515

本文探讨了一种寻找能容纳最多水的两个垂直线的算法。给定一系列非负整数，每个代表坐标上的高度，通过找出能够形成最大面积的两条线来解决实际问题。文章提供了一个具体的例子和实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Notice

You may not slant the container.

Have you met this question in a real interview?

Yes

Example

Given [1,3,2], the max area of the container is 2.

class Solution {
public:
    /**
     * @param heights: a vector of integers
     * @return: an integer
     */
    int maxArea(vector<int> &h) {
        // write your code here
        int res=0;  
        int n = h.size();  
        int l=0,r=n-1;  
        while(l<r)  
        {  
            res=max(res,min(h[l],h[r])*(r-l));  
            if (h[l]<h[r])  
            {  
                int k=l;  
                while(k<r&&h[k]<=h[l])  
                    k++;  
                l=k;  
                }  
            else  
            {  
                int k=r;  
                while(k>l&&h[k]<=h[r])  
                    k--;  
                r=k;  
             }  
        }  
        return res;  
    }
};