2022-10-04

[github-actions]

No description provided.

[Akiq2016]

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

// @lc code=start
class Solution {
    public int maxArea(int[] height) {
        if (height.length == 2) {
            return Math.min(height[0], height[1]);
        }

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

---

Nickname: Aki
From vscode-hzfe-algorithms