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.
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
Code
- java
class Solution {
public int maxArea(int[] height) {
int result = 0;
int low = 0, high = height.length-1;
while(low < high) {
result = Math.max(result, Math.min(height[low] , height[high]) * (high-low));
if(height[low] <= height[high]) low++;
else high--;
}
return result;
}
}
- Official solution
- Time complexity: O(n). Single pass.
- Space complexity: O(1). Constant space is used.
public 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;
}
}
Conclusion
- 自己的思路和官方解答差不多哈哈哈,two pointer思想牛逼