leetcode-11. Container With Most Water

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

搜索区间左右两边向内搜索

 

对于每一个区间[i,j]

area(i,j)=(j-i)*min(h[i],h[j])

引理：

(1)如果有 h[i]<h[j] ，那么对于任何k有area(i,j-k)<area(i,j)

(2)如果有 h[i]>h[j] ，那么对于任何k有area(i-k,j)<area(i,j)

证明：

area(i,j)=(j-i)*min(h[i],h[j])=(j-i)*h[i]

area(i,j-k) = (j-k-i)*min(h[i],h[j-k])

if h[j-k]<h[i] : area(i,j-k) = (j-k-i)*min(h[i],h[j-k])=(j-k-i)*h[j-k]<(j-i)*h[i]=area(i,j)

if h[j-k]>=h[j] : area(i,j-k) = (j-k-i)*min(h[i],h[j-k])= (j-k-i)*h[i]<(j-i)*h[i]=area(i,j)

即证(1)

因此根据每次h[i]和h[j]大小比较，缩小搜索区间的一边

h[i]<h[j]         i++

h[i]>h[j]         j--

static const auto seedup=[](){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    return nullptr;
}();
class Solution {
public:
    int maxArea(vector<int>& height) {
        int i=0,j=height.size()-1;
        int area=0;
        while(i<j){
            area = max(area,(j-i)*min(height[i],height[j]));
            if(height[i]>height[j]){
                j--;
            }
            else{
                i++;
            }
        }
        
        
        /*
        int size = height.size();
                
        long area=0;
        int start = 0;
        
        for(int i = 0;i<size;i++){
            if(height[i]==0||height[i]<height[start]){continue;}
            int minj = area/height[i]+i;
            if(minj>size){continue;}
            int end=size-1;
            for(int j =end;j>minj;j--){
                if(height[j]<height[end]){continue;}
                if(area<((j-i)*(min(height[i],height[j])))){
                    area = (j-i)*(min(height[i],height[j]));
                    start = i;
                    end = j;
                }
                    
            }
        }*/
        return area;
    }
};