mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-19 06:50:59 +00:00
Add multilingual exercise code (#1959)
Replace the exercise pages' Python-only snippets with source-backed implementations for the 13 visible programming languages, and localize reader-facing comments by site language. Zig remains out of scope. Approval bypass: repository protection requires one approval but does not enforce it for administrators. All 68 completed checks succeeded; four non-required Java jobs remained queued on the existing ubuntu-20.04 workflow, with no failed checks.
This commit is contained in:
@@ -0,0 +1,50 @@
|
||||
// File: complexity_exercises.go
|
||||
// Created Time: 2026-08-18
|
||||
// Author: Hello Algo Team
|
||||
|
||||
package chapter_computational_complexity
|
||||
|
||||
/* 迭代求和 */
|
||||
func sumIter(n int) int {
|
||||
res := 0
|
||||
for i := 1; i <= n; i++ {
|
||||
res += i
|
||||
}
|
||||
return res
|
||||
}
|
||||
|
||||
/* 递归求和 */
|
||||
func sumRecur(n int) int {
|
||||
if n == 1 {
|
||||
return 1
|
||||
}
|
||||
return n + sumRecur(n-1)
|
||||
}
|
||||
|
||||
/* 线性阶循环 */
|
||||
func linearLoop(n int) int {
|
||||
res := 0
|
||||
for i := 0; i < n; i++ {
|
||||
res += i
|
||||
}
|
||||
return res
|
||||
}
|
||||
|
||||
/* 平方阶循环 */
|
||||
func quadraticLoop(n int) int {
|
||||
res := 0
|
||||
for i := 0; i < n; i++ {
|
||||
for j := i; j < n; j++ {
|
||||
res += j
|
||||
}
|
||||
}
|
||||
return res
|
||||
}
|
||||
|
||||
/* 对数阶循环 */
|
||||
func logarithmicLoop(n int) int {
|
||||
for n > 1 {
|
||||
n /= 2
|
||||
}
|
||||
return n
|
||||
}
|
||||
@@ -0,0 +1,22 @@
|
||||
// File: complexity_exercises_test.go
|
||||
// Created Time: 2026-08-18
|
||||
// Author: Hello Algo Team
|
||||
|
||||
package chapter_computational_complexity
|
||||
|
||||
import "testing"
|
||||
|
||||
func TestComplexityExercises(t *testing.T) {
|
||||
if sumIter(1) != 1 || sumRecur(1) != 1 {
|
||||
t.Fatal("sum functions failed for n = 1")
|
||||
}
|
||||
if sumIter(4) != 10 || sumRecur(4) != 10 {
|
||||
t.Fatal("sum functions failed for n = 4")
|
||||
}
|
||||
if linearLoop(4) != 6 || quadraticLoop(4) != 20 {
|
||||
t.Fatal("complexity loops returned an unexpected value")
|
||||
}
|
||||
if logarithmicLoop(4) != 1 || logarithmicLoop(5) != 1 {
|
||||
t.Fatal("logarithmic loop returned an unexpected value")
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,17 @@
|
||||
// File: fast_power.go
|
||||
// Created Time: 2026-08-18
|
||||
// Author: Hello Algo Team
|
||||
|
||||
package chapter_divide_and_conquer
|
||||
|
||||
/* 快速幂 */
|
||||
func fastPow(x, n int) int {
|
||||
if n == 0 {
|
||||
return 1
|
||||
}
|
||||
half := fastPow(x, n/2)
|
||||
if n%2 == 0 {
|
||||
return half * half
|
||||
}
|
||||
return half * half * x
|
||||
}
|
||||
@@ -0,0 +1,13 @@
|
||||
// File: fast_power_test.go
|
||||
// Created Time: 2026-08-18
|
||||
// Author: Hello Algo Team
|
||||
|
||||
package chapter_divide_and_conquer
|
||||
|
||||
import "testing"
|
||||
|
||||
func TestFastPower(t *testing.T) {
|
||||
if fastPow(7, 0) != 1 || fastPow(3, 5) != 243 || fastPow(2, 6) != 64 {
|
||||
t.Fatal("fast power returned an unexpected value")
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user