mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 02:46:30 +08:00
f68bbb0d59
* Revised the book * Update the book with the second revised edition * Revise base on the manuscript of the first edition
33 lines
727 B
Python
33 lines
727 B
Python
"""
|
||
File: max_capacity.py
|
||
Created Time: 2023-07-21
|
||
Author: Krahets (krahets@163.com)
|
||
"""
|
||
|
||
|
||
def max_capacity(ht: list[int]) -> int:
|
||
"""最大容量：贪心"""
|
||
# 初始化 i, j，使其分列数组两端
|
||
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}")
|