mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-31 04:17:14 +00:00
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
This commit is contained in:
Yudong Jin
@@ -0,0 +1,25 @@
|
||||
/**
|
||||
* File: ListNode.kt
|
||||
* Created Time: 2024-01-25
|
||||
* Author: curtishd (1023632660@qq.com)
|
||||
*/
|
||||
|
||||
package utils
|
||||
|
||||
/* Linked list node */
|
||||
class ListNode(var _val: Int) {
|
||||
var next: ListNode? = null
|
||||
|
||||
companion object {
|
||||
/* Deserialize a list into a linked list */
|
||||
fun arrToLinkedList(arr: IntArray): ListNode? {
|
||||
val dum = ListNode(0)
|
||||
var head = dum
|
||||
for (_val in arr) {
|
||||
head.next = ListNode(_val)
|
||||
head = head.next!!
|
||||
}
|
||||
return dum.next
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,107 @@
|
||||
/**
|
||||
* File: PrintUtil.kt
|
||||
* Created Time: 2024-01-25
|
||||
* Author: curtishd (1023632660@qq.com)
|
||||
*/
|
||||
|
||||
package utils
|
||||
|
||||
import java.util.*
|
||||
|
||||
class Trunk(var prev: Trunk?, var str: String)
|
||||
|
||||
/* Print matrix (Array) */
|
||||
fun <T> printMatrix(matrix: Array<Array<T>>) {
|
||||
println("[")
|
||||
for (row in matrix) {
|
||||
println(" $row,")
|
||||
}
|
||||
println("]")
|
||||
}
|
||||
|
||||
/* Print matrix (List) */
|
||||
fun <T> printMatrix(matrix: MutableList<MutableList<T>>) {
|
||||
println("[")
|
||||
for (row in matrix) {
|
||||
println(" $row,")
|
||||
}
|
||||
println("]")
|
||||
}
|
||||
|
||||
/* Print linked list */
|
||||
fun printLinkedList(h: ListNode?) {
|
||||
var head = h
|
||||
val list = mutableListOf<String>()
|
||||
while (head != null) {
|
||||
list.add(head._val.toString())
|
||||
head = head.next
|
||||
}
|
||||
println(list.joinToString(separator = " -> "))
|
||||
}
|
||||
|
||||
/* Print binary tree */
|
||||
fun printTree(root: TreeNode?) {
|
||||
printTree(root, null, false)
|
||||
}
|
||||
|
||||
/**
|
||||
* Print binary tree
|
||||
* This tree printer is borrowed from TECHIE DELIGHT
|
||||
* https://www.techiedelight.com/c-program-print-binary-tree/
|
||||
*/
|
||||
fun printTree(root: TreeNode?, prev: Trunk?, isRight: Boolean) {
|
||||
if (root == null) {
|
||||
return
|
||||
}
|
||||
|
||||
var prevStr = " "
|
||||
val trunk = Trunk(prev, prevStr)
|
||||
|
||||
printTree(root.right, trunk, true)
|
||||
|
||||
if (prev == null) {
|
||||
trunk.str = "———"
|
||||
} else if (isRight) {
|
||||
trunk.str = "/———"
|
||||
prevStr = " |"
|
||||
} else {
|
||||
trunk.str = "\\———"
|
||||
prev.str = prevStr
|
||||
}
|
||||
|
||||
showTrunks(trunk)
|
||||
println(" ${root._val}")
|
||||
|
||||
if (prev != null) {
|
||||
prev.str = prevStr
|
||||
}
|
||||
trunk.str = " |"
|
||||
|
||||
printTree(root.left, trunk, false)
|
||||
}
|
||||
|
||||
fun showTrunks(p: Trunk?) {
|
||||
if (p == null) {
|
||||
return
|
||||
}
|
||||
showTrunks(p.prev)
|
||||
print(p.str)
|
||||
}
|
||||
|
||||
/* Print hash table */
|
||||
fun <K, V> printHashMap(map: Map<K, V>) {
|
||||
for ((key, value) in map) {
|
||||
println("${key.toString()} -> $value")
|
||||
}
|
||||
}
|
||||
|
||||
/* Print heap */
|
||||
fun printHeap(queue: Queue<Int>?) {
|
||||
val list = mutableListOf<Int?>()
|
||||
queue?.let { list.addAll(it) }
|
||||
print("Heap array representation:")
|
||||
println(list)
|
||||
println("Heap tree representation:")
|
||||
val root = TreeNode.listToTree(list)
|
||||
printTree(root)
|
||||
}
|
||||
@@ -0,0 +1,69 @@
|
||||
/**
|
||||
* File: TreeNode.kt
|
||||
* Created Time: 2024-01-25
|
||||
* Author: curtishd (1023632660@qq.com)
|
||||
*/
|
||||
|
||||
package utils
|
||||
|
||||
/* Binary tree node class */
|
||||
/* Constructor */
|
||||
class TreeNode(
|
||||
var _val: Int // Node value
|
||||
) {
|
||||
var height: Int = 0 // Node height
|
||||
var left: TreeNode? = null // Reference to left child node
|
||||
var right: TreeNode? = null // Reference to right child node
|
||||
|
||||
// For the serialization encoding rules, please refer to:
|
||||
// https://www.hello-algo.com/chapter_tree/array_representation_of_tree/
|
||||
// Array representation of binary tree:
|
||||
// [1, 2, 3, 4, None, 6, 7, 8, 9, None, None, 12, None, None, 15]
|
||||
// Linked list representation of binary tree:
|
||||
// /——— 15
|
||||
// /——— 7
|
||||
// /——— 3
|
||||
// | \——— 6
|
||||
// | \——— 12
|
||||
// ——— 1
|
||||
// \——— 2
|
||||
// | /——— 9
|
||||
// \——— 4
|
||||
// \——— 8
|
||||
|
||||
/* Deserialize a list into a binary tree: recursion */
|
||||
companion object {
|
||||
private fun listToTreeDFS(arr: MutableList<Int?>, i: Int): TreeNode? {
|
||||
if (i < 0 || i >= arr.size || arr[i] == null) {
|
||||
return null
|
||||
}
|
||||
val 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 */
|
||||
fun listToTree(arr: MutableList<Int?>): TreeNode? {
|
||||
return listToTreeDFS(arr, 0)
|
||||
}
|
||||
|
||||
/* Serialize a binary tree into a list: recursion */
|
||||
private fun treeToListDFS(root: TreeNode?, i: Int, res: MutableList<Int?>) {
|
||||
if (root == null) return
|
||||
while (i >= res.size) {
|
||||
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 */
|
||||
fun treeToList(root: TreeNode?): MutableList<Int?> {
|
||||
val res = mutableListOf<Int?>()
|
||||
treeToListDFS(root, 0, res)
|
||||
return res
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,30 @@
|
||||
/**
|
||||
* File: Vertex.kt
|
||||
* Created Time: 2024-01-25
|
||||
* Author: curtishd (1023632660@qq.com)
|
||||
*/
|
||||
|
||||
package utils
|
||||
|
||||
/* Vertex class */
|
||||
class Vertex(val _val: Int) {
|
||||
companion object {
|
||||
/* Input value list vals, return vertex list vets */
|
||||
fun valsToVets(vals: IntArray): Array<Vertex?> {
|
||||
val vets = arrayOfNulls<Vertex>(vals.size)
|
||||
for (i in vals.indices) {
|
||||
vets[i] = Vertex(vals[i])
|
||||
}
|
||||
return vets
|
||||
}
|
||||
|
||||
/* Input vertex list vets, return value list vals */
|
||||
fun vetsToVals(vets: MutableList<Vertex?>): MutableList<Int> {
|
||||
val vals = mutableListOf<Int>()
|
||||
for (vet in vets) {
|
||||
vals.add(vet!!._val)
|
||||
}
|
||||
return vals
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user