2023-07-24 03:06:47 +08:00
|
|
|
|
// File: max_capacity.go
|
|
|
|
|
|
// Created Time: 2023-07-23
|
|
|
|
|
|
// Author: Reanon (793584285@qq.com)
|
|
|
|
|
|
|
|
|
|
|
|
package chapter_greedy
|
|
|
|
|
|
|
|
|
|
|
|
import "math"
|
|
|
|
|
|
|
|
|
|
|
|
/* 最大容量：贪心 */
|
|
|
|
|
|
func maxCapacity(ht []int) int {
|
2023-12-28 18:06:09 +08:00
|
|
|
|
// 初始化 i, j，使其分列数组两端
|
2023-07-24 03:06:47 +08:00
|
|
|
|
i, j := 0, len(ht)-1
|
|
|
|
|
|
// 初始最大容量为 0
|
|
|
|
|
|
res := 0
|
|
|
|
|
|
// 循环贪心选择，直至两板相遇
|
|
|
|
|
|
for i < j {
|
|
|
|
|
|
// 更新最大容量
|
|
|
|
|
|
capacity := int(math.Min(float64(ht[i]), float64(ht[j]))) * (j - i)
|
|
|
|
|
|
res = int(math.Max(float64(res), float64(capacity)))
|
|
|
|
|
|
// 向内移动短板
|
|
|
|
|
|
if ht[i] < ht[j] {
|
|
|
|
|
|
i++
|
|
|
|
|
|
} else {
|
|
|
|
|
|
j--
|
|
|
|
|
|
}
|
|
|
|
|
|
}
|
|
|
|
|
|
return res
|
|
|
|
|
|
}
|
