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-08-27 10:27:13 +00: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.go
+// Created Time: 2023-07-23
+// Author: Reanon (793584285@qq.com)
+
+package chapter_dynamic_programming
+
+import "math"
+
+/* Coin change: Dynamic programming */
+func coinChangeDP(coins []int, amt int) int {
+	n := len(coins)
+	max := amt + 1
+	// Initialize dp table
+	dp := make([][]int, n+1)
+	for i := 0; i <= n; i++ {
+		dp[i] = make([]int, amt+1)
+	}
+	// State transition: first row and first column
+	for a := 1; a <= amt; a++ {
+		dp[0][a] = max
+	}
+	// State transition: rest of the rows and columns
+	for i := 1; i <= n; i++ {
+		for a := 1; a <= amt; a++ {
+			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] = int(math.Min(float64(dp[i-1][a]), float64(dp[i][a-coins[i-1]]+1)))
+			}
+		}
+	}
+	if dp[n][amt] != max {
+		return dp[n][amt]
+	}
+	return -1
+}
+
+/* Coin change: Dynamic programming */
+func coinChangeDPComp(coins []int, amt int) int {
+	n := len(coins)
+	max := amt + 1
+	// Initialize dp table
+	dp := make([]int, amt+1)
+	for i := 1; i <= amt; i++ {
+		dp[i] = max
+	}
+	// State transition
+	for i := 1; i <= n; i++ {
+		// Traverse in forward order
+		for a := 1; a <= amt; a++ {
+			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] = int(math.Min(float64(dp[a]), float64(dp[a-coins[i-1]]+1)))
+			}
+		}
+	}
+	if dp[amt] != max {
+		return dp[amt]
+	}
+	return -1
+}