您的位置:首页 > 大数据 > 人工智能

leetcode Container With Most Water 难度系数3 3.4

2014-01-28 12:02 411 查看
Question:

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.
public class Solution {
public int maxArea(int[] height) {
if (height.length==0) {
return 0;
}
int first = 0;
int last = height.length-1;
int area = 0;
int result = 0;
int minHeight = 0;
while(first<last){
minHeight =  Math.min(height[first], height[last]);
area = minHeight*(last-first);
result = Math.max(area, result);
if (height[first]<=height[last]) {
first++;
}else {
last--;
}
}
return result;
}
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  leetcode java 面试