[LeetCode OJ]11. 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.

Subscribe to see which companies asked this question

class Solution {
public:
int maxArea(vector<int>& height) {
int left = 0;
int right = height.size() - 1;
int number = 0;
int container = 0;
while(left !=right)
{
container = (right - left) * min(height[right],height[left]);
if(container > number)
{
number = container;
}
if(height[left] <= height [right])
{
left++;
}
else
{
right--;
}
}
return number;
}
};