LeetCode By Scala Container With Most Water_leetcode scala-优快云博客

本文链接：https://blog.youkuaiyun.com/zhengshidao/article/details/77714127

本文针对给定的一系列坐标数组，解决如何选择两条直线形成最大容器以容纳最多水量的问题。通过双指针技术逐步逼近最优解，实现了高效的算法设计。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container and n is at least 2.

object ContainerWithMostWater {
  def main(args: Array[String]): Unit = {
    println(maxArea(Array(1, 1)))
  }

  /**
    * 总结：读题真的给我 造成了很大的困扰
    * 题目大意：给定一系列的坐标数组，每个点都是（i ai），无序的，问要选择两条直线使得围起来的容器能装多少水，最大的水
    * 解法：从容器底部的长度出发，最长的开始搜索，每次保存高的点，比较水的多少即可
    * @param height
    * @return
    */
  def maxArea(height: Array[Int]): Int = {
    if (height.length < 2 || height == null)
      0
    var max: Int = 0

//    left 和 right 代表 横坐标 从两端开始
    var left: Int = 0
    var right: Int = height.length - 1

    while (left < right) {
      max = Math.max(max, (right - left) * Math.min(height(left), height(right)))

//      保留高的点，低的点向高点靠拢
      if (height(left) < height(right))
        left += 1
      else
        right -= 1

    }
    max
  }
}