classSolution { public: intmaxArea(vector<int>& height){ int n = height.size(); int left = 0, right = n - 1; int ans = (right - left) * min(height[left], height[right]);
while (left < right) { if (height[left] < height[right]) left++; elseif (height[left] == height[right]) { left++; right--; } else right--; ans = max(ans, (right - left) * min(height[left], height[right])); }