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-24 17:17: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,24 @@
+/**
+ * File: list_node.dart
+ * Created Time: 2023-01-23
+ * Author: Jefferson (JeffersonHuang77@gmail.com)
+ */
+
+/* Linked list node */
+class ListNode {
+  int val;
+  ListNode? next;
+
+  ListNode(this.val, [this.next]);
+}
+
+/* Deserialize a list into a linked list */
+ListNode? listToLinkedList(List<int> list) {
+  ListNode dum = ListNode(0);
+  ListNode? head = dum;
+  for (int val in list) {
+    head?.next = ListNode(val);
+    head = head?.next;
+  }
+  return dum.next;
+}
@@ -0,0 +1,90 @@
+/**
+ * File: print_util.dart
+ * Created Time: 2023-01-23
+ * Author: Jefferson (JeffersonHuang77@gmail.com)
+ */
+
+import 'dart:io';
+
+import 'list_node.dart';
+import 'tree_node.dart';
+
+class Trunk {
+  Trunk? prev;
+  String str;
+
+  Trunk(this.prev, this.str);
+}
+
+/* Print matrix (Array) */
+void printMatrix(List<List<int>> matrix) {
+  print("[");
+  for (List<int> row in matrix) {
+    print("  $row,");
+  }
+  print("]");
+}
+
+/* Print linked list */
+void printLinkedList(ListNode? head) {
+  List<String> list = [];
+
+  while (head != null) {
+    list.add('${head.val}');
+    head = head.next;
+  }
+
+  print(list.join(' -> '));
+}
+
+/**
+ * Print binary tree
+ * This tree printer is borrowed from TECHIE DELIGHT
+ * https://www.techiedelight.com/c-program-print-binary-tree/
+ */
+void printTree(TreeNode? root, [Trunk? prev = null, bool isRight = false]) {
+  if (root == null) {
+    return;
+  }
+
+  String prev_str = '    ';
+  Trunk trunk = Trunk(prev, prev_str);
+
+  printTree(root.right, trunk, true);
+
+  if (prev == null) {
+    trunk.str = '———';
+  } else if (isRight) {
+    trunk.str = '/———';
+    prev_str = '   |';
+  } else {
+    trunk.str = '\\———';
+    prev.str = prev_str;
+  }
+  showTrunks(trunk);
+  print(' ${root.val}');
+
+  if (prev != null) {
+    prev.str = prev_str;
+  }
+  trunk.str = '   |';
+
+  printTree(root.left, trunk, false);
+}
+
+void showTrunks(Trunk? p) {
+  if (p == null) {
+    return;
+  }
+
+  showTrunks(p.prev);
+  stdout.write(p.str);
+}
+
+/* Print heap */
+void printHeap(List<int> heap) {
+  print("Array representation of heap: $heap");
+  print("Heap tree representation:");
+  TreeNode? root = listToTree(heap);
+  printTree(root);
+}
@@ -0,0 +1,50 @@
+/**
+ * File: tree_node.dart
+ * Created Time: 2023-2-12
+ * Author: Jefferson (JeffersonHuang77@gmail.com)
+ */
+
+/* Binary tree node class */
+class TreeNode {
+  int val; // Node value
+  int height; // Node height
+  TreeNode? left; // Reference to left child node
+  TreeNode? right; // Reference to right child node
+
+  /* Constructor */
+  TreeNode(this.val, [this.height = 0, this.left, this.right]);
+}
+
+/* Deserialize a list into a binary tree: recursion */
+TreeNode? listToTreeDFS(List<int?> arr, int i) {
+  if (i < 0 || i >= arr.length || arr[i] == null) {
+    return null;
+  }
+  TreeNode? root = TreeNode(arr[i]!);
+  root.left = listToTreeDFS(arr, 2 * i + 1);
+  root.right = listToTreeDFS(arr, 2 * i + 2);
+  return root;
+}
+
+/* Deserialize a list into a binary tree */
+TreeNode? listToTree(List<int?> arr) {
+  return listToTreeDFS(arr, 0);
+}
+
+/* Serialize a binary tree into a list: recursion */
+void treeToListDFS(TreeNode? root, int i, List<int?> res) {
+  if (root == null) return;
+  while (i >= res.length) {
+    res.add(null);
+  }
+  res[i] = root.val;
+  treeToListDFS(root.left, 2 * i + 1, res);
+  treeToListDFS(root.right, 2 * i + 2, res);
+}
+
+/* Serialize a binary tree into a list */
+List<int?> treeToList(TreeNode? root) {
+  List<int?> res = [];
+  treeToListDFS(root, 0, res);
+  return res;
+}
@@ -0,0 +1,29 @@
+/**
+ * File: Vertex.dart
+ * Created Time: 2023-05-15
+ * Author: liuyuxin (gvenusleo@gmail.com)
+ */
+
+/* Vertex class */
+class Vertex {
+  int val;
+  Vertex(this.val);
+
+  /* Input value list vals, return vertex list vets */
+  static List<Vertex> valsToVets(List<int> vals) {
+    List<Vertex> vets = [];
+    for (int i in vals) {
+      vets.add(Vertex(i));
+    }
+    return vets;
+  }
+
+  /* Input vertex list vets, return value list vals */
+  static List<int> vetsToVals(List<Vertex> vets) {
+    List<int> vals = [];
+    for (Vertex vet in vets) {
+      vals.add(vet.val);
+    }
+    return vals;
+  }
+}