题目:https://leetcode.com/problems/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.
分析 :暴力搜索O(N*N)会TLE。一个比较好的方法是,从两端往中间搜,哪边的y值小,就往中间走一格。
Java实现:
public class Solution {
public int maxArea(int[] height)
{
int max = 0;
int i=0, j=height.length-1;
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;
}
}