【LC】11. 盛最多水的容器

---

题目描述

题解

思路：两个边界哪个小，收缩哪个

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