Container With Most Water Medium
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.
public int maxArea(int[] height) { int n = height.length; int max = 0; int i = 0, j = n - 1; while (i < j) { max = Math.max(Math.min(height[i], height[j]) * (j - i), max); if (height[i] < height[j]) { ++i; } else { --j; } } return max; }
思路:注意题意,每柱间隔相等,所以使用夹逼法,从两边每次缩小一格(保留较长的柱子)。
1634

被折叠的 条评论
为什么被折叠?



