LeetCode (Container With Most Water)

Problem:

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 and n is at least 2.

Solution:

class Solution {
public:
int maxArea(vector<int>& height) {
int max=0,b=0,e=height.size()-1;
while(b<e){
max=Max(max,(e-b)*Min(height[b],height[e]));
if (height[b]>height[e])
e--;
else
b++;
}
return max;
}
private:
int Max(int a,int b){
return a>b?a:b;
}
int Min(int a,int b){
return a>b?b:a;
}
};