LeetCode 11. 盛最多水的容器

11. 盛最多水的容器

思路：双指针，放弃低的那边

class Solution {
public:
    int maxArea(vector<int>& height) {
        int n=height.size();
        int left=0, right=n-1, res=0;
        while(left<right){
            int h = min(height[left], height[right]);
            res = max(res, h*(right-left));
            if(height[left]>height[right]) right--;
            else left++;
        }
        return res;
    }
};