11.Container With Most Water

来源:互联网 发布:异星工厂加入物流网络 编辑:程序博客网 时间:2024/06/05 11:06

Container With Most Water

 Total Accepted: 33299 Total Submissions: 104359My Submissions

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

Show Tags
Have you met this question in a real interview? 
Yes
 
No

思路:用双指针,首尾向中间靠拢即可。

class Solution {
public:
    int maxArea(vector<int> &height) {
        int num=height.size();
        if(num<2) return 0;
        int left=0,right=num-1;
        int res=min(height[left],height[right])*(right-left);
        while(left<right){
            //找到下一个位置
            if(height[left]<height[right]){
                int tem=left+1;
                while(tem<right && height[tem]<=height[left]){
                    ++tem;
                }
                left=tem;
            }else{
                int tem=right-1;
                while(left<tem && height[tem]<=height[right]){
                    --tem;
                }
                right=tem;
            }
            //更新
            int tem_res=min(height[left],height[right])*(right-left);
            if(tem_res>res) res=tem_res;
        }
        return res;
    }
};

0 0
原创粉丝点击