https://leetcode-cn.com/problems/container-with-most-water/ 数组、双指针
双指针
function maxArea(height: number[]): number {if (height.length < 1) return 0let l: number = 0let r: number = height.length - 1let max: number = 0while (l < r) {let h = Math.min(height[l], height[r]);let w = r - l;max = Math.max(max, h * w)height[l] < height[r] ? l++ : r--}return max};
