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

解析重点

1.暴力解法，穷举，两个for循环。这里我们考虑。
2.我们根据题目描述maxArea=min(a[i],a[j])*(j-i+1),i<j<a.length.根据公式，我们如果滑动a[i],a[j]中的较小值，那么maxArea肯定减小。那么我们每次只能滑动i和j中
较小的值。

java代码

class Solution {
    public int maxArea(int[] a) {
		 int max = 0;
		 for(int i = 0, j = a.length - 1; i < j ; ){
			 int minHeight = a[i] < a[j] ? a[i ++] : a[j --];//比较i、j中较小的值，并滑动较小的值
			 max = Math.max(max, (j - i + 1) * minHeight);
		 }
		 return max;
	 }
}