11.盛最多水的容器.java

/*
 * @lc app=leetcode.cn id=11 lang=java
 *
 * [11] 盛最多水的容器
 */

// @lc code=start
class Solution {
    public int maxArea(int[] height) {

        int ans = 0;
        int l = 0, r = height.length - 1;
        while (l < r) {
            int h = Math.min(height[l], height[r]);
            ans = Math.max(ans, h * (r - l));
            if (height[l] > height[r]) r -- ;
            else l ++ ;
        }
        return ans;
    }
}
// @lc code=end