Container with Most Water
约 1 分钟· 本文阅读 次
本页目录
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.
Solution
From both sides to the center.
Complexity
时间复杂度 O(n),空间复杂度 O(1)
Code
public class Solution {
public int maxArea(int[] height) {
int left = 0, right = height.length - 1;
int res = 0;
while (left < right) {
res = Math.max(res,
Math.min(height[left],height[right]) * (right - left));
if (height[left] > height[right]) --right;
else ++left;
}
return res;
}
}相关文章
- All Permutations II2016-01-10
- All Permutation2016-01-10
- All Subsets2016-01-10
- Best Time to Buy and Sell Stock II2016-01-10
已恢复到上次阅读位置