# LeetCode 011. Container With Most Water

### Container With Most Water

Given n non-negative integers a1a2, ..., an, where each represents a point at coordinate (iai). n vertical lines are drawn such that the two endpoints of line i is at (iai) 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 i =0;
int j =height.size()-1;
int max = 0;
int area = 0;
int high = 0;
while(i<j)
{
if(height[i] < height[j])
{
area = height[i]*(j-i);
i++;
}
else
{
area = height[j]*(j-i);
j--;
}
if(area > max)
max = area;
}
return max;
}
};

03-02 2059

04-06 1159
06-15 377
03-31 340
09-30 5486
12-09 3919