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-18 04: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,49 @@
+/**
+ * File: climbing_stairs_dp.swift
+ * Created Time: 2023-07-15
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+/* Climbing stairs: Dynamic programming */
+func climbingStairsDP(n: Int) -> Int {
+    if n == 1 || n == 2 {
+        return n
+    }
+    // Initialize dp table, used to store solutions to subproblems
+    var dp = Array(repeating: 0, count: n + 1)
+    // Initial state: preset the solution to the smallest subproblem
+    dp[1] = 1
+    dp[2] = 2
+    // State transition: gradually solve larger subproblems from smaller ones
+    for i in 3 ... n {
+        dp[i] = dp[i - 1] + dp[i - 2]
+    }
+    return dp[n]
+}
+
+/* Climbing stairs: Space-optimized dynamic programming */
+func climbingStairsDPComp(n: Int) -> Int {
+    if n == 1 || n == 2 {
+        return n
+    }
+    var a = 1
+    var b = 2
+    for _ in 3 ... n {
+        (a, b) = (b, a + b)
+    }
+    return b
+}
+
+@main
+enum ClimbingStairsDP {
+    /* Driver Code */
+    static func main() {
+        let n = 9
+
+        var res = climbingStairsDP(n: n)
+        print("Climbing \(n) stairs has \(res) solutions")
+
+        res = climbingStairsDPComp(n: n)
+        print("Climbing \(n) stairs has \(res) solutions")
+    }
+}