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 area=0;
if(height.empty()||height.size()<2){
return area;
}
int i=0,j=height.size()-1;
while(i<j){
if(height[i]>height[j]){
area=max(area,(j-i)*height[j]);
j--;
}else{
area=max(area,(j-i)*height[i]);
i++;
}
}
return area;
}
};