【leetcode】Container With Most Water

Container With Most Water

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.

 

 

利用p1，p2标识height[0]和height[n-1]

比较两者的大小，如果height[p1]>=height[p2]，则p2--，否则p1++

（如果height[p1]>=height[p2]时，我们让p1++，这样是没有意义的，后续求的所有面积必然比当前的要小）

  

 

class Solution {
public:
    int maxArea(vector<int> &height) {
       
        int n=height.size();
        int p1=0;
        int p2=n-1;
       
        int maxArea=0;
        while(p1<p2)
        {
            int area;
            if(height[p1]>=height[p2])
            {
                area=(p2-p1)*height[p2];
                p2--;
            }
            else
            {
                area=(p2-p1)*height[p1];
                p1++;
            }
            maxArea=area>maxArea?area:maxArea;
        }
        return maxArea;
    }
};