Problem description:

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 and n is at least 2.

Solution:

1
2
3
4
5
6
7
8
9
10
11
12
13
class Solution {
public:
    int maxArea(vector<int>& height) {
        int l= 0, r= height.size()-1;
        int max_area= 0;
        while(l< r){
            int tmp= min(height[l], height[r])* (r-l);
            max_area= max(max_area, tmp);
            height[l]< height[r]? l++: r--;
        }
        return max_area;
    }
};

time complexity: $O()$
space complexity: $O()$
reference: