70 lines
2.1 KiB
Swift
70 lines
2.1 KiB
Swift
/**
|
|
* File: coin_change.swift
|
|
* Created Time: 2023-07-15
|
|
* Author: nuomi1 (nuomi1@qq.com)
|
|
*/
|
|
|
|
/* Coin change: Dynamic programming */
|
|
func coinChangeDP(coins: [Int], amt: Int) -> Int {
|
|
let n = coins.count
|
|
let MAX = amt + 1
|
|
// Initialize dp table
|
|
var dp = Array(repeating: Array(repeating: 0, count: amt + 1), count: n + 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 dp[n][amt] != MAX ? dp[n][amt] : -1
|
|
}
|
|
|
|
/* Coin change: Space-optimized dynamic programming */
|
|
func coinChangeDPComp(coins: [Int], amt: Int) -> Int {
|
|
let n = coins.count
|
|
let MAX = amt + 1
|
|
// Initialize dp table
|
|
var dp = Array(repeating: MAX, count: amt + 1)
|
|
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 dp[amt] != MAX ? dp[amt] : -1
|
|
}
|
|
|
|
@main
|
|
enum CoinChange {
|
|
/* Driver Code */
|
|
static func main() {
|
|
let coins = [1, 2, 5]
|
|
let amt = 4
|
|
|
|
// Dynamic programming
|
|
var res = coinChangeDP(coins: coins, amt: amt)
|
|
print("Minimum number of coins required to make up target amount = \(res)")
|
|
|
|
// Space-optimized dynamic programming
|
|
res = coinChangeDPComp(coins: coins, amt: amt)
|
|
print("Minimum number of coins required to make up target amount = \(res)")
|
|
}
|
|
}
|