题目链接
贪心策略
class Solution {
public:
int maxArea(vector<int>& height) {
int i = 0, j = height.size() - 1;
int max_area = -1;
while (i < j)
{
int w = j - i, h = height[i] < height[j] ? height[i++] : height[j--];
max_area = max(w * h, max_area);
}
return max_area;
}
};
