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-21 15:57:14 +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,59 @@
+/**
+* File: hanota.cs
+* Created Time: 2023-07-18
+* Author: hpstory (hpstory1024@163.com)
+*/
+
+namespace hello_algo.chapter_divide_and_conquer;
+
+public class hanota {
+    /* Move a disk */
+    void Move(List<int> src, List<int> tar) {
+        // Take out a disk from the top of src
+        int pan = src[^1];
+        src.RemoveAt(src.Count - 1);
+        // Place the disk on top of tar
+        tar.Add(pan);
+    }
+
+    /* Solve the Tower of Hanoi problem f(i) */
+    void DFS(int i, List<int> src, List<int> buf, List<int> tar) {
+        // If there is only one disk left in src, move it directly to tar
+        if (i == 1) {
+            Move(src, tar);
+            return;
+        }
+        // Subproblem f(i-1): move the top i-1 disks from src to buf using tar
+        DFS(i - 1, src, tar, buf);
+        // Subproblem f(1): move the remaining disk from src to tar
+        Move(src, tar);
+        // Subproblem f(i-1): move the top i-1 disks from buf to tar using src
+        DFS(i - 1, buf, src, tar);
+    }
+
+    /* Solve the Tower of Hanoi problem */
+    void SolveHanota(List<int> A, List<int> B, List<int> C) {
+        int n = A.Count;
+        // Move the top n disks from A to C using B
+        DFS(n, A, B, C);
+    }
+
+    [Test]
+    public void Test() {
+        // The tail of the list is the top of the rod
+        List<int> A = [5, 4, 3, 2, 1];
+        List<int> B = [];
+        List<int> C = [];
+        Console.WriteLine("In initial state:");
+        Console.WriteLine("A = " + string.Join(", ", A));
+        Console.WriteLine("B = " + string.Join(", ", B));
+        Console.WriteLine("C = " + string.Join(", ", C));
+
+        SolveHanota(A, B, C);
+
+        Console.WriteLine("After disk movement is complete:");
+        Console.WriteLine("A = " + string.Join(", ", A));
+        Console.WriteLine("B = " + string.Join(", ", B));
+        Console.WriteLine("C = " + string.Join(", ", C));
+    }
+}