盛最多水的容器

class Solution {
public:
    int maxArea(vector<int>& height) {

    }
};

双指针 第一次不看题解有思路 看来多刷题真的很有用

class Solution {
    public int maxArea(int[] height) {
        if(height.length<2) return 0;
    int left = 0;
    int right = height.length-1;
    // ans 为结果 min为两个木板的长度最小值
    int ans = 0; int min = 0;
    while(left<right){
        min = Math.min(height[left],height[right]);
        ans = Math.max(ans,(right-left)*min);
        // 如果左边短 就右移
        if(height[left]<height[right]){
            left++;
        }else{
            // 右边短就左移
            right --;
        }
    }
    return ans;

    }

class Solution {
public:
    int maxArea(vector<int>& height) {
        //定义双指针
        int left=0;
        int right=height.size()-1;
        int ans=-99999;
        while(left<right){
            int area=min(height[left],height[right])*(right-left);
            ans=max(ans,area);
            if(height[left]<height[right])left++;
            else{
                right--;
            }
        }
        return ans;
    }
};