mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-05 11:41:22 +08:00
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
34 lines
772 B
Python
34 lines
772 B
Python
"""
|
|
File: max_capacity.py
|
|
Created Time: 2023-07-21
|
|
Author: krahets (krahets@163.com)
|
|
"""
|
|
|
|
|
|
def max_capacity(ht: list[int]) -> int:
|
|
"""Max capacity: Greedy algorithm"""
|
|
# Initialize i, j to be at both ends of the array
|
|
i, j = 0, len(ht) - 1
|
|
# Initial max capacity is 0
|
|
res = 0
|
|
# Loop for greedy selection until the two boards meet
|
|
while i < j:
|
|
# Update max capacity
|
|
cap = min(ht[i], ht[j]) * (j - i)
|
|
res = max(res, cap)
|
|
# Move the shorter board inward
|
|
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]
|
|
|
|
# Greedy algorithm
|
|
res = max_capacity(ht)
|
|
print(f"Max capacity is {res}")
|