mirror of
https://github.com/krahets/hello-algo.git
synced 2026-05-05 00:13:13 +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
70 lines
2.0 KiB
Swift
70 lines
2.0 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: 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 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 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 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 coins needed to make target amount is \(res)")
|
|
|
|
// Space-optimized dynamic programming
|
|
res = coinChangeDPComp(coins: coins, amt: amt)
|
|
print("Minimum coins needed to make target amount is \(res)")
|
|
}
|
|
}
|