11. Container With Most Water
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.
嘲笑一下自己 刚开始读了几遍题 都没有读懂什么意思,英语果然都还给老师了。说正经的 本题的解题思路:
1:首先假设找到的纵线为(i, ai)、(j,aj),max=(j-i)*min(ai, aj);(i < j)
2:假设在j的右边存在k使得(k > j && ak > aj),则min(ai, aj, ak) = min(ai, aj),则(k-i)*min(ai, aj) > max 与假设不符,所以在j的右边不会有比它还高的线。
3:假设在i的左边存在t使得(t < i && at > ai),则min(at, ai, aj) = min(ai, aj),则(j-t)*min(ai, aj) > max 与假设不符,所以在i的左边不会有比它还高的线。
所以从两边向中间靠拢,即可求出最大值。
代码:
public int maxArea(int[] height) {
int len = height.length;
int max = 0;
int i = 0;
int j = len-1;
while(i < j){
int t = (j-i)*Math.min(height[i], height[j]);
if(max < t){
max = t;
}
if(height[i] > height[j]){
j--;
}else{
i++;
}
}
return max;
}