2023-07-21 15:16:51 +08:00
|
|
|
|
"""
|
|
|
|
|
|
File: max_capacity.py
|
|
|
|
|
|
Created Time: 2023-07-21
|
|
|
|
|
|
Author: Krahets (krahets@163.com)
|
|
|
|
|
|
"""
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def max_capacity(ht: list[int]) -> int:
|
|
|
|
|
|
"""最大容量：贪心"""
|
2023-12-28 18:06:09 +08:00
|
|
|
|
# 初始化 i, j，使其分列数组两端
|
2023-07-21 15:16:51 +08:00
|
|
|
|
i, j = 0, len(ht) - 1
|
|
|
|
|
|
# 初始最大容量为 0
|
|
|
|
|
|
res = 0
|
|
|
|
|
|
# 循环贪心选择，直至两板相遇
|
|
|
|
|
|
while i < j:
|
|
|
|
|
|
# 更新最大容量
|
|
|
|
|
|
cap = min(ht[i], ht[j]) * (j - i)
|
|
|
|
|
|
res = max(res, cap)
|
|
|
|
|
|
# 向内移动短板
|
|
|
|
|
|
if ht[i] < ht[j]:
|
|
|
|
|
|
i += 1
|
|
|
|
|
|
else:
|
|
|
|
|
|
j -= 1
|
|
|
|
|
|
return res
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
"""Driver Code"""
|
|
|
|
|
|
if __name__ == "__main__":
|
|
|
|
|
|
ht = [3, 8, 5, 2, 7, 7, 3, 4]
|
|
|
|
|
|
|
|
|
|
|
|
# 贪心算法
|
|
|
|
|
|
res = max_capacity(ht)
|
|
|
|
|
|
print(f"最大容量为 {res}")
|
