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-13 12:20:57 +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,41 @@
+/**
+* File: climbing_stairs_backtrack.cs
+* Created Time: 2023-06-30
+* Author: hpstory (hpstory1024@163.com)
+*/
+
+namespace hello_algo.chapter_dynamic_programming;
+
+public class climbing_stairs_backtrack {
+    /* Backtracking */
+    void Backtrack(List<int> choices, int state, int n, List<int> res) {
+        // When climbing to the n-th stair, add 1 to the solution count
+        if (state == n)
+            res[0]++;
+        // Traverse all choices
+        foreach (int choice in choices) {
+            // Pruning: not allowed to go beyond the n-th stair
+            if (state + choice > n)
+                continue;
+            // Attempt: make choice, update state
+            Backtrack(choices, state + choice, n, res);
+            // Backtrack
+        }
+    }
+
+    /* Climbing stairs: Backtracking */
+    int ClimbingStairsBacktrack(int n) {
+        List<int> choices = [1, 2]; // Can choose to climb up 1 or 2 stairs
+        int state = 0; // Start climbing from the 0-th stair
+        List<int> res = [0]; // Use res[0] to record the solution count
+        Backtrack(choices, state, n, res);
+        return res[0];
+    }
+
+    [Test]
+    public void Test() {
+        int n = 9;
+        int res = ClimbingStairsBacktrack(n);
+        Console.WriteLine($"Climbing {n} stairs has {res} solutions");
+    }
+}