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.

Solution:

class Solution {
public:
int maxArea(vector<int>& height) {
int len = height.size();
int maxarea = 0;
int i = 0, j = len - 1;
while(i < j)
{
if(height[i] <= height[j])
{
maxarea = max(maxarea, height[i] * (j - i));
i++;
}
else
{
maxarea = max(maxarea, height[j] * (j - i));
j--;
}
}

return maxarea;
}
};