问题:
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.
给一个数组,每个数字代表一个高度,如图所示,找最大容水量
分析:用双指针来做,不断向内移动直到重合。这个方法是有严谨的数学证明的。直觉上来讲,试图去想什么时候可能出现比上一个容量更大的可能。注意:高度永远被短板限制!!
那么指针的移动只有一种方式:就是向内移动小指针(因为移动大指针的话,短板是不变的,而且宽度还-1),而移动小指针,就是(potentially)提高短板,如果提高的够多,就可以cover宽度-1的损失。
代码:
class Solution {
public int maxArea(int[] height) {
int i = 0, j = height.length-1, max = 0;
while (i < j){
max = Math.max(max, Math.min(height[i], height[j])*(j-i));
if (height[i] > height[j]) j--;
else i++;
}
return max;
}
}