leetcode: 11. Container With Most Water

Difficulty

Medium

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.

 



The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

 

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

Solution

Time Complexity: O(n)
Space Complexity: O(1)

class Solution {
    public int maxArea(int[] height) {
        int maxarea = 0, l = 0, r = height.length - 1;
        while (l < r) {
            maxarea = Math.max(maxarea, Math.min(height[l], height[r]) * (r - l));  
            if (height[l] < height[r])  //寻找最大值
                l++;
            else
                r--;
        }
        return maxarea;
    }

Time Complexity: O(n^2)
Space Complexity: O(1)

//暴力搜索
class Solution {
    public int maxArea(int[] height) {
        int ret = 0;
        for (int i = 0; i < height.length; i++) 
            for (int j = i + 1; j < height.length; j++) {
                 ret = Math.max(ret, Math.min(height[i], height[j]) * (j - i));
            }
        return ret;
    }
}