Container With Most Water

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container.

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

return ans;
}
};