Leetcode: Container With Most Water

class Solution {
public:
    /*
    贪心：
    从长度最长开始，即left=0,right=height.size()-1
    每次更新宽度小的那个边界，left向右移动，right向左移动
    同步更新答案 即area 
    */
    int maxArea(vector<int>& height) {
        int n=height.size();
        int left=0;
        int right=n-1;
        int max_area=(right-left)* min(height[left],height[right]);
        while(left<right){
            if(height[left]<height[right]){
                left++;
            }
            else{
                right--;
            }
            int max_=(right-left)* min(height[left],height[right]);
            max_area=max(max_,max_area);
        }
        return max_area;
    }
};