/** * 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: the rest of the rows and columns for (i in 1..n) { for (a in 1..amt) { if (coins[i - 1] > a) { // If exceeding the target amount, do not choose coin i dp[i][a] = dp[i - 1][a] } else { // The smaller value between not choosing and choosing 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 exceeding the target amount, do not choose coin i dp[a] = dp[a] } else { // The smaller value between not choosing and choosing 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 number of coins required to make up the target amount = $res") // Space-optimized dynamic programming res = coinChangeDPComp(coins, amt) println("Minimum number of coins required to make up the target amount = $res") }