LeetCode 11. Container With Most Water
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.
class Solution {
public int maxArea(int[] height) {
int lo = 0;
int hi = height.length - 1;
int maxarea = 0;
while (lo < hi) {
maxarea = Math.max(maxarea, Math.min(height[lo], height[hi]) * (hi - lo));
if (height[lo] < height[hi]) {
lo++;
}
else
hi--;
}
return maxarea;
}
}
Complexity Analysis
Time complexity : O(n). Single pass.
Space complexity : O(1). Constant space is used.