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

11. Container With Most Water

2017-12-23 08:40 471 查看
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​2)
class Solution {
public int maxArea(int[] height) {
int l = 0;
int area = 0;
for (int i = 0; i < height.length - 1; i++) {
for (int j = i; j < height.length; j++) {
area = Math.max(area, Math.abs((j - i) * Math.min(height[j], height[i])));
}
}
return area;
}
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签:  Array algorithm