Container with Most Water

06/23/2016 Array Two Pointers


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.


Result: Accepted Time: 24ms

Here should be some explanations.

class Solution {
    int maxArea(vector<int>& height) {
        int low = 0, up = height.size() - 1,ret = 0;
        while(low < up)
            if(height[low] < height[up])
                ret = max(height[low]*(up-low),ret),low++;
                ret = max(height[up]*(up-low),ret),up--;
        return ret;

Complexity Analytics

  • Time Complexity:
  • Space Complexity: