mirror of
https://github.com/krahets/hello-algo.git
synced 2026-05-05 08:53:42 +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
71 lines
2.0 KiB
Kotlin
71 lines
2.0 KiB
Kotlin
/**
|
|
* File: coin_change.kt
|
|
* Created Time: 2024-01-25
|
|
* Author: curtishd (1023632660@qq.com)
|
|
*/
|
|
|
|
package chapter_dynamic_programming
|
|
|
|
import kotlin.math.min
|
|
|
|
/* Coin change: Dynamic programming */
|
|
fun coinChangeDP(coins: IntArray, amt: Int): Int {
|
|
val n = coins.size
|
|
val MAX = amt + 1
|
|
// Initialize dp table
|
|
val dp = Array(n + 1) { IntArray(amt + 1) }
|
|
// State transition: first row and first column
|
|
for (a in 1..amt) {
|
|
dp[0][a] = MAX
|
|
}
|
|
// State transition: rest of the rows and columns
|
|
for (i in 1..n) {
|
|
for (a in 1..amt) {
|
|
if (coins[i - 1] > a) {
|
|
// If exceeds target amount, don't select coin i
|
|
dp[i][a] = dp[i - 1][a]
|
|
} else {
|
|
// The smaller value between not selecting and selecting coin i
|
|
dp[i][a] = min(dp[i - 1][a], dp[i][a - coins[i - 1]] + 1)
|
|
}
|
|
}
|
|
}
|
|
return if (dp[n][amt] != MAX) dp[n][amt] else -1
|
|
}
|
|
|
|
/* Coin change: Space-optimized dynamic programming */
|
|
fun coinChangeDPComp(coins: IntArray, amt: Int): Int {
|
|
val n = coins.size
|
|
val MAX = amt + 1
|
|
// Initialize dp table
|
|
val dp = IntArray(amt + 1)
|
|
dp.fill(MAX)
|
|
dp[0] = 0
|
|
// State transition
|
|
for (i in 1..n) {
|
|
for (a in 1..amt) {
|
|
if (coins[i - 1] > a) {
|
|
// If exceeds target amount, don't select coin i
|
|
dp[a] = dp[a]
|
|
} else {
|
|
// The smaller value between not selecting and selecting coin i
|
|
dp[a] = min(dp[a], dp[a - coins[i - 1]] + 1)
|
|
}
|
|
}
|
|
}
|
|
return if (dp[amt] != MAX) dp[amt] else -1
|
|
}
|
|
|
|
/* Driver Code */
|
|
fun main() {
|
|
val coins = intArrayOf(1, 2, 5)
|
|
val amt = 4
|
|
|
|
// Dynamic programming
|
|
var res = coinChangeDP(coins, amt)
|
|
println("Minimum coins needed to make target amount is $res")
|
|
|
|
// Space-optimized dynamic programming
|
|
res = coinChangeDPComp(coins, amt)
|
|
println("Minimum coins needed to make target amount is $res")
|
|
} |