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-17 22:10:59 +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,109 @@
+/**
+ * File: space_complexity.kt
+ * Created Time: 2024-01-25
+ * Author: curtishd (1023632660@qq.com)
+ */
+
+package chapter_computational_complexity.space_complexity
+
+import utils.ListNode
+import utils.TreeNode
+import utils.printTree
+
+/* Function */
+fun function(): Int {
+    // Perform some operations
+    return 0
+}
+
+/* Constant order */
+fun constant(n: Int) {
+    // Constants, variables, objects occupy O(1) space
+    val a = 0
+    var b = 0
+    val nums = Array(10000) { 0 }
+    val node = ListNode(0)
+    // Variables in the loop occupy O(1) space
+    for (i in 0..<n) {
+        val c = 0
+    }
+    // Functions in the loop occupy O(1) space
+    for (i in 0..<n) {
+        function()
+    }
+}
+
+/* Linear order */
+fun linear(n: Int) {
+    // Array of length n uses O(n) space
+    val nums = Array(n) { 0 }
+    // A list of length n occupies O(n) space
+    val nodes = mutableListOf<ListNode>()
+    for (i in 0..<n) {
+        nodes.add(ListNode(i))
+    }
+    // A hash table of length n occupies O(n) space
+    val map = mutableMapOf<Int, String>()
+    for (i in 0..<n) {
+        map[i] = i.toString()
+    }
+}
+
+/* Linear order (recursive implementation) */
+fun linearRecur(n: Int) {
+    println("Recursion n = $n")
+    if (n == 1)
+        return
+    linearRecur(n - 1)
+}
+
+/* Exponential order */
+fun quadratic(n: Int) {
+    // Matrix uses O(n^2) space
+    val numMatrix = arrayOfNulls<Array<Int>?>(n)
+    // 2D list uses O(n^2) space
+    val numList = mutableListOf<MutableList<Int>>()
+    for (i in 0..<n) {
+        val tmp = mutableListOf<Int>()
+        for (j in 0..<n) {
+            tmp.add(0)
+        }
+        numList.add(tmp)
+    }
+}
+
+/* Quadratic order (recursive implementation) */
+tailrec fun quadraticRecur(n: Int): Int {
+    if (n <= 0)
+        return 0
+    // Array nums has length n, n-1, ..., 2, 1
+    val nums = Array(n) { 0 }
+    println("In recursion n = $n, nums length = ${nums.size}")
+    return quadraticRecur(n - 1)
+}
+
+/* Driver Code */
+fun buildTree(n: Int): TreeNode? {
+    if (n == 0)
+        return null
+    val root = TreeNode(0)
+    root.left = buildTree(n - 1)
+    root.right = buildTree(n - 1)
+    return root
+}
+
+/* Driver Code */
+fun main() {
+    val n = 5
+    // Constant order
+    constant(n)
+    // Linear order
+    linear(n)
+    linearRecur(n)
+    // Exponential order
+    quadratic(n)
+    quadraticRecur(n)
+    // Exponential order
+    val root = buildTree(n)
+    printTree(root)
+}