mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-24 09:07:14 +00: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
28 lines
607 B
Go
28 lines
607 B
Go
// File: coin_change_greedy.go
|
|
// Created Time: 2023-07-23
|
|
// Author: Reanon (793584285@qq.com)
|
|
|
|
package chapter_greedy
|
|
|
|
/* Coin change: Greedy algorithm */
|
|
func coinChangeGreedy(coins []int, amt int) int {
|
|
// Assume coins list is sorted
|
|
i := len(coins) - 1
|
|
count := 0
|
|
// Loop to make greedy choices until no remaining amount
|
|
for amt > 0 {
|
|
// Find the coin that is less than and closest to the remaining amount
|
|
for i > 0 && coins[i] > amt {
|
|
i--
|
|
}
|
|
// Choose coins[i]
|
|
amt -= coins[i]
|
|
count++
|
|
}
|
|
// If no feasible solution is found, return -1
|
|
if amt != 0 {
|
|
return -1
|
|
}
|
|
return count
|
|
}
|