mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-07 20:50:58 +08:00
2778a6f9c7
* 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
49 lines
1.6 KiB
Python
49 lines
1.6 KiB
Python
"""
|
|
File: coin_change_greedy.py
|
|
Created Time: 2023-07-18
|
|
Author: krahets (krahets@163.com)
|
|
"""
|
|
|
|
|
|
def coin_change_greedy(coins: list[int], amt: int) -> int:
|
|
"""Coin change: Greedy algorithm"""
|
|
# Assume coins list is sorted
|
|
i = len(coins) - 1
|
|
count = 0
|
|
# Loop to make greedy choices until no remaining amount
|
|
while amt > 0:
|
|
# Find the coin that is less than and closest to the remaining amount
|
|
while i > 0 and coins[i] > amt:
|
|
i -= 1
|
|
# Choose coins[i]
|
|
amt -= coins[i]
|
|
count += 1
|
|
# If no feasible solution is found, return -1
|
|
return count if amt == 0 else -1
|
|
|
|
|
|
"""Driver Code"""
|
|
if __name__ == "__main__":
|
|
# Greedy algorithm: Can guarantee finding the global optimal solution
|
|
coins = [1, 5, 10, 20, 50, 100]
|
|
amt = 186
|
|
res = coin_change_greedy(coins, amt)
|
|
print(f"\ncoins = {coins}, amt = {amt}")
|
|
print(f"The minimum number of coins needed to make {amt} is {res}")
|
|
|
|
# Greedy algorithm: Cannot guarantee finding the global optimal solution
|
|
coins = [1, 20, 50]
|
|
amt = 60
|
|
res = coin_change_greedy(coins, amt)
|
|
print(f"\ncoins = {coins}, amt = {amt}")
|
|
print(f"The minimum number of coins needed to make {amt} is {res}")
|
|
print(f"Actually the minimum number needed is 3, i.e., 20 + 20 + 20")
|
|
|
|
# Greedy algorithm: Cannot guarantee finding the global optimal solution
|
|
coins = [1, 49, 50]
|
|
amt = 98
|
|
res = coin_change_greedy(coins, amt)
|
|
print(f"\ncoins = {coins}, amt = {amt}")
|
|
print(f"The minimum number of coins needed to make {amt} is {res}")
|
|
print(f"Actually the minimum number needed is 2, i.e., 49 + 49")
|