xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-08-17 14:10:57 +00:00
Code Issues Packages Projects Releases Wiki Activity

Translate all code to English (#1836)

Browse Source 
* 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
2025-12-31 07:44:52 +08:00
committed by GitHub
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
Download Patch File Download Diff File Expand all files Collapse all files
en/codes/go/chapter_dynamic_programming/edit_distance_test.go
+40
View File
@@ -0,0 +1,40 @@
// File: edit_distance_test.go
// Created Time: 2023-07-23
// Author: Reanon (793584285@qq.com)
package chapter_dynamic_programming
import (
"fmt"
"testing"
)
func TestEditDistanceDFS(test *testing.T) {
s := "bag"
t := "pack"
n := len(s)
m := len(t)
// Brute-force search
res := editDistanceDFS(s, t, n, m)
fmt.Printf("Changing %s to %s requires a minimum of %d edits\n", s, t, res)
// Memoization search
mem := make([][]int, n+1)
for i := 0; i <= n; i++ {
mem[i] = make([]int, m+1)
for j := 0; j <= m; j++ {
mem[i][j] = -1
}
}
res = editDistanceDFSMem(s, t, mem, n, m)
fmt.Printf("Changing %s to %s requires a minimum of %d edits\n", s, t, res)
// Dynamic programming
res = editDistanceDP(s, t)
fmt.Printf("Changing %s to %s requires a minimum of %d edits\n", s, t, res)
// Space-optimized dynamic programming
res = editDistanceDPComp(s, t)
fmt.Printf("Changing %s to %s requires a minimum of %d edits\n", s, t, res)
}