11. 盛最多水的容器

https://leetcode-cn.com/problems/container-with-most-water/

i指向0位置，j指向最后一个位置，每次移动指向较小数的指针。

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

    // 双指针
    public int maxArea(int[] height) {
        int max = 0;
        int i = 0, j = height.length-1;
        while (i < j) {
            max = Math.max(max, (j-i)* Math.min(height[i], height[j]));
            if (height[i] < height[j])
                i++;
            else
                j--;
        }
        return max;
    }

    public static void main(String[] args) {
        int[] arg={4,55,55,4};
        int i = new Solution().maxArea(arg);
        System.out.println("i = " + i);
    }
}