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 n = height.size();
if (n <= 1)
return 0;
int maxsum = 0;
int i = 0, j = n - 1;
while (i < j) {
int mini = height[i] < height[j] ? height[i] : height[j];
int temp = mini * (j - i);
if (temp > maxsum)
maxsum = temp;
if (height[i] < height[j])
i++;
else
j--;
}
return maxsum;
}
};