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.
This problem is different from largest rectangle in histogram. It's just a line instead of a histogram. So there is no water.
class Solution {
public:
int maxArea(vector<int> &height) {
int size = height.size(), l = 0, r = size - 1, res = 0;
if (size == 0)
return 0;
while (l < r) {
if (res < (r - l)*min(height[l],height[r]))
res = (r - l)*min(height[l],height[r]);
if (height[l] <= height[r])
++l;
else
--r;
}
return res;
}
};