11. Container With Most Water

Medium

Problem Description

11. Container With Most Water

Medium

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

Notice that you may not slant the container.

 

Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: 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 2:

Input: height = [1,1]
Output: 1

 

Constraints:

  • n == height.length
  • 2 <= n <= 105
  • 0 <= height[i] <= 104

Solution

0011-container-with-most-water.java

java
0011-container-with-most-water.java
1class Solution { 2 public int maxArea(int[] height) { 3 int max=0; 4 int left=0; 5 int right=height.length-1; 6 while(left<right){ 7 int minimum=Math.min(height[left],height[right]); 8 int full=minimum*(right-left); 9 if(full>max){ 10 max=full; 11 } 12 if(minimum==height[right]) right--; 13 else left++; 14 } 15 return max; 16 } 17}
LeetCode Practice