本文链接：https://blog.csdn.net/weixin_43766190/article/details/99663780

11. 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(sloping, rather than horizontal or vertical) the container and n is at least 2.

Example:

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

解法一:

首先想到的是找 $m a x (m i n (a i, a j) * (j - i))$ . 这样的时间复杂度是 $O(n^2)$ . 当然作为medium的题，肯定不会这么简单的

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

解法二:

没有必要每次循环两遍，而是保留每次的最大值，同时两边比较小的那一方向中间靠拢，直到确定最大值。有点儿像：怎么找到田里面最大的麦穗，就是每次摘下遇到的最大的一个，要是有更大的就换掉这个更大的，直到走完麦田，哈哈。这个题变成两个人。编不下去了，大概就是这个意思。

class Solution {
    public int maxArea(int[] height) {
        int max = 0, l = 0, r = height.length - 1;
        while (l < r){
            max = Math.max(max, Math.min(height[l],height[r]) * (r-l));
            if (height[l] < height[r])
                l++;
            else
                r--;
        }
        return max;
    }
}