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.
Show Similar Problems
class Solution {
public:
int maxArea(vector<int>& height) {
int C = 0, tmp = 0;
if( !height.size() ) return 0;
vector<int>::iterator left = height.begin();
vector<int>::iterator right = height.end() - 1;
while( left < right)
{
tmp = (right - left) * min( *left, * right);
C = C < tmp ? tmp : C;
*left > *right ? (right--): (left ++);
}
return C;
}
};