leetcode-----11. 盛最多水的容器

• 链接：https://leetcode-cn.com/problems/container-with-most-water/

思路

  双指针法

代码

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