mirror of
https://github.com/krahets/hello-algo.git
synced 2026-09-02 05:07:13 +00:00
Yudong Jin
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
53 lines
1.7 KiB
Kotlin
53 lines
1.7 KiB
Kotlin
/**
|
|
* File: coin_change_greedy.kt
|
|
* Created Time: 2024-01-25
|
|
* Author: curtishd (1023632660@qq.com)
|
|
*/
|
|
|
|
package chapter_greedy
|
|
|
|
/* Coin change: Greedy algorithm */
|
|
fun coinChangeGreedy(coins: IntArray, amt: Int): Int {
|
|
// Assume coins list is sorted
|
|
var am = amt
|
|
var i = coins.size - 1
|
|
var count = 0
|
|
// Loop to make greedy choices until no remaining amount
|
|
while (am > 0) {
|
|
// Find the coin that is less than and closest to the remaining amount
|
|
while (i > 0 && coins[i] > am) {
|
|
i--
|
|
}
|
|
// Choose coins[i]
|
|
am -= coins[i]
|
|
count++
|
|
}
|
|
// If no feasible solution is found, return -1
|
|
return if (am == 0) count else -1
|
|
}
|
|
|
|
/* Driver Code */
|
|
fun main() {
|
|
// Greedy algorithm: Can guarantee finding the global optimal solution
|
|
var coins = intArrayOf(1, 5, 10, 20, 50, 100)
|
|
var amt = 186
|
|
var res = coinChangeGreedy(coins, amt)
|
|
println("\ncoins = ${coins.contentToString()}, amt = $amt")
|
|
println("Minimum coins needed to make $amt is $res")
|
|
|
|
// Greedy algorithm: Cannot guarantee finding the global optimal solution
|
|
coins = intArrayOf(1, 20, 50)
|
|
amt = 60
|
|
res = coinChangeGreedy(coins, amt)
|
|
println("\ncoins = ${coins.contentToString()}, amt = $amt")
|
|
println("Minimum coins needed to make $amt is $res")
|
|
println("Actually the minimum number needed is 3, i.e., 20 + 20 + 20")
|
|
|
|
// Greedy algorithm: Cannot guarantee finding the global optimal solution
|
|
coins = intArrayOf(1, 49, 50)
|
|
amt = 98
|
|
res = coinChangeGreedy(coins, amt)
|
|
println("\ncoins = ${coins.contentToString()}, amt = $amt")
|
|
println("Minimum coins needed to make $amt is $res")
|
|
println("Actually the minimum number needed is 2, i.e., 49 + 49")
|
|
} |