xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-07 05:04:20 +00:00
Code Issues Packages Projects Releases Wiki Activity

Re-translate the Japanese version (#1871)

Browse Source 
* Retranslate Japanese docs with GPT-5.4

* Retranslate Japanese code with GPT-5.4
This commit is contained in:
Yudong Jin
2026-03-30 07:30:15 +08:00
committed by GitHub
parent fe6443235b
commit d7b2277d2b
1444 changed files with 83312 additions and 8363 deletions
Download Patch File Download Diff File Expand all files Collapse all files
ja/codes/python/chapter_greedy/max_capacity.py
+8 -8
View File
@@ -7,16 +7,16 @@ Author: krahets (krahets@163.com)
def max_capacity(ht: list[int]) -> int:
"""最大容量：貪欲法"""
# i、j を初期化、配列の両端で分割させる
# i, j を初期化し、それぞれ配列の両端に置く
i, j = 0, len(ht) - 1
# 初期最大容量は 0
# 初期の最大容量は 0
res = 0
# 2 つの板が出会うまで貪欲選択をループ
# 2 枚の板が出会うまで貪欲選択を繰り返す
while i < j:
# 最大容量を更新
# 最大容量を更新する
cap = min(ht[i], ht[j]) * (j - i)
res = max(res, cap)
# 短い板を内側に移動
# 短い方を内側へ動かす
if ht[i] < ht[j]:
i += 1
else:
@@ -24,10 +24,10 @@ def max_capacity(ht: list[int]) -> int:
return res
"""ドライバーコード"""
"""Driver Code"""
if __name__ == "__main__":
ht = [3, 8, 5, 2, 7, 7, 3, 4]
# 貪欲アルゴリズム
# 貪欲法
res = max_capacity(ht)
print(f"最大容量は {res}")
print(f"最大容量は {res}")