Java_LeetCode11 容器如何装尽可能多的水

11. Container With Most Water

Description

Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). nvertical 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 1

Input: [1,8,6,2,5,4,8,3,7]

Output: 49

Solution1

首先想到的直观方法，BruteSearch。双层for循环查找；依次找出相对较短的高度作为矩形的一条边，另外两个指针的差值作为另外一条边。保存一下此时的area,下次搜索的时候比较一下。

class Solution
{
    public int maxArea(int[] height)
	{
        int maxArea = 0;
		
        for (int i = 0; i < height.length; i++)
		{
			for (int j = i + 1; j < height.length; j++)
			{
				int length = Math.min(height[i], height[j]);
				int width = j - i;
				int curArea =  length * width;
				maxArea = Math.max(maxArea, curArea);
			}
		}
        return maxArea;
    }
}

Solution2

双指针（这个和之前做过的一道把奇数和偶数分开的题目使用的解法差不多剑指offer21），双指针规避了大量的搜索，速度比较上面提升了不少。

public class Solution {
    public int maxArea(int[] height) {
        int left = 0;
	int right = height.length-1;
	int max = 0,temp = 0;
	while(left<right) {
		if(height[left] > height[right]){
			temp = (right-left) * height[right];
			right--;
		}else{
			temp = (right-left) * height[left];
			left++;
		}
		max = max > temp ? max :temp;
	}
	return max;
     }
}

Solution3(19/7/20)

下面是另外一个答案，也是LeetCode后面的Discuss区的一个解法

public int maxArea(int[] height) {
    int maxA = 0;
    
    int i = 0, j = height.length-1;
    
    while(i < j) {
        int H = Math.min(height[i], height[j]);
        int W = j - i;
        maxA = Math.max(maxA, H*W);
        
        while(i < j && height[i] <= H) {
            ++i;
        }
        while(i < j && height[j] <= H) {
            --j;
        }
    }
    return maxA;
}

有while（i<j）,在里面也要判断i<j.
其实和解法二思路差不多。

Appendix

1.Solution2代码来自LeetCodeContributor:
james_shu_sunlin