leetcode 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 most = 0;
int len =  height.size();
for (int i =0,j= len-1;i!=j;)
{
int min = std::min(height[i],height[j]);
most = std::max(most,(j - i) * min);
if (height[i] < height[j]) i++;
else j--;
}

return most;
}
};