Translate all code to English (#1836)

* 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
2026-09-23 14:56:39 +08:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,66 @@
+/**
+ * File: coin_change_ii.kt
+ * Created Time: 2024-01-25
+ * Author: curtishd (1023632660@qq.com)
+ */
+
+package chapter_dynamic_programming
+
+/* Coin change II: Dynamic programming */
+fun coinChangeIIDP(coins: IntArray, amt: Int): Int {
+    val n = coins.size
+    // Initialize dp table
+    val dp = Array(n + 1) { IntArray(amt + 1) }
+    // Initialize first column
+    for (i in 0..n) {
+        dp[i][0] = 1
+    }
+    // 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[i][a] = dp[i - 1][a]
+            } else {
+                // Sum of the two options: not selecting and selecting coin i
+                dp[i][a] = dp[i - 1][a] + dp[i][a - coins[i - 1]]
+            }
+        }
+    }
+    return dp[n][amt]
+}
+
+/* Coin change II: Space-optimized dynamic programming */
+fun coinChangeIIDPComp(coins: IntArray, amt: Int): Int {
+    val n = coins.size
+    // Initialize dp table
+    val dp = IntArray(amt + 1)
+    dp[0] = 1
+    // 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 {
+                // Sum of the two options: not selecting and selecting coin i
+                dp[a] = dp[a] + dp[a - coins[i - 1]]
+            }
+        }
+    }
+    return dp[amt]
+}
+
+/* Driver Code */
+fun main() {
+    val coins = intArrayOf(1, 2, 5)
+    val amt = 5
+
+    // Dynamic programming
+    var res = coinChangeIIDP(coins, amt)
+    println("Number of coin combinations to make target amount is $res")
+
+    // Space-optimized dynamic programming
+    res = coinChangeIIDPComp(coins, amt)
+    println("Number of coin combinations to make target amount is $res")
+}