本文共 678 字，大约阅读时间需要 2 分钟。
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.
Java代码：public class Solution { public int maxArea(int[] height) { int j = height.length - 1, i = 0, ma = 0; while (i < j) { ma = Math.max(ma, (j - i) * (Math.min(height[i], height[j]))); if (height[i] < height[j]) { i++; } else if (height[i] >= height[j]) { j--; } } return ma; }} 转载地址：http://tnuni.baihongyu.com/