LeetCode Problem
11. Container With Most Water
Link to LeetCode
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
Analysis
Initially we can assume the result is 0. Then we scan from both sides.
If leftHeight < rightHeight, move right and find a value that is greater than leftHeight.
Similarily, if leftHeight > rightHeight, move left and find a value that is greater than rightHeight. Additionally, keep tracking the max value.
class Solution {
public int maxArea(int[] height) {
if (height == null || height.length < 2) {
return 0;
}
int max = 0;
int left = 0;
int right = height.length - 1;
while (left < right) {
max = Math.max(max, (right - left) * Math.min(height[left], height[right]));
if (height[left] < height[right])
left++;
else
right--;
}
return max;
}
}