【LeetCode】 11. Container With Most Water 盛最多水的容器(Medium)(JAVA)
题目地址: https://leetcode.com/problems/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 and n is at least 2.
The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
Example:
Input: [1,8,6,2,5,4,8,3,7]
Output: 49
题目大意
给定 n 个非负整数 a1,a2,…,an,每个数代表坐标中的一个点 (i, ai) 。在坐标内画 n 条垂直线,垂直线 i 的两个端点分别为 (i, ai) 和 (i, 0)。找出其中的两条线,使得它们与 x 轴共同构成的容器可以容纳最多的水。
解题方法
左右两边往中间遍历,大的保持不变,小的继续往前
class Solution {
public int maxArea(int[] height) {
int max = 0;
int start = 0;
int end = height.length - 1;
while (start < end) {
max = Math.max(Math.min(height[start], height[end]) * (end - start), max);
if (height[start] > height[end]) {
end--;
} else {
start++;
}
}
return max;
}
}
执行用时 : 4 ms, 在所有 Java 提交中击败了 75.11% 的用户
内存消耗 : 41.4 MB, 在所有 Java 提交中击败了 5.07% 的用户