https://leetcode-cn.com/problems/container-with-most-water/ 数组、双指针

双指针

  1. function maxArea(height: number[]): number {
  2. if (height.length < 1) return 0
  3. let l: number = 0
  4. let r: number = height.length - 1
  5. let max: number = 0
  6. while (l < r) {
  7. let h = Math.min(height[l], height[r]);
  8. let w = r - l;
  9. max = Math.max(max, h * w)
  10. height[l] < height[r] ? l++ : r--
  11. }
  12. return max
  13. };