mirror of
https://github.com/krahets/hello-algo.git
synced 2025-10-31 18:37:48 +08:00
f68bbb0d59
* Revised the book * Update the book with the second revised edition * Revise base on the manuscript of the first edition
29 lines
594 B
Go
29 lines
594 B
Go
// File: max_capacity.go
|
||
// Created Time: 2023-07-23
|
||
// Author: Reanon (793584285@qq.com)
|
||
|
||
package chapter_greedy
|
||
|
||
import "math"
|
||
|
||
/* 最大容量：贪心 */
|
||
func maxCapacity(ht []int) int {
|
||
// 初始化 i, j，使其分列数组两端
|
||
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
|
||
}
|