题目描述
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.
code:
public class Solution {
public int maxArea(int[] height) {
int result = 0;
if(height.length <= 1)
return 0;
int a = 0;
int b = height.length -1;
while(a<b)
{
int sum = (b - a) * Math.min(height[b],height[a]);
if(sum > result) result = sum;
if(height[a] > height[b])
b--;
else
a++;
}
return result;
}
}
题目使用了贪心的思想。