Container WIth Most Water
1.题目描述
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 the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.
Notice that you may not slant the container.
2.Example
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.
3.Solution
1.暴力解法
使用两个for循环遍历使毎两个竖线之间相乘,找出面积最大的两个竖线。
public class Solution {
public int maxArea(int[] height) {
int maxarea = 0;
for (int i = 0; i < height.length; i++)
for (int j = i + 1; j < height.length; j++)
maxarea = Math.max(maxarea, Math.min(height[i], height[j]) * (j - i));
return maxarea;
}
}
2.使用两个指针
一个指针数组从头开始,一个指针从数组尾巴开始向中间前进,过程中如果头指针对应的高度低于尾指针的话,就让头指针往前进一;如果尾指针高度低于头指针的话,就让尾指针减一(因为决定储存水多少的是两个高度中较低的那个,因此将长度较短处的指针往下一个位置移动,如果下个位置的长度较长,那么面积就变大,如果下个位置的长度反而变短了,那就继续移动)。
注意保存最大面积的数值。
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;
}
}