1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
package main
import "fmt"
// 1. 阶乘函数
func factorial(n int) int {
if n <= 1 {
return 1
}
return n * factorial(n-1)
}
// 2. 斐波那契数列
func fibonacci(n int) int {
if n <= 1 {
return n
}
return fibonacci(n-1) + fibonacci(n-2)
}
// 3. 带记忆化的斐波那契数列
func fibonacciMemo(n int, memo map[int]int) int {
if n <= 1 {
return n
}
if val, exists := memo[n]; exists {
return val
}
memo[n] = fibonacciMemo(n-1, memo) + fibonacciMemo(n-2, memo)
return memo[n]
}
// 4. 二分查找
func binarySearch(arr []int, target, left, right int) int {
if left > right {
return -1
}
mid := left + (right-left)/2
if arr[mid] == target {
return mid
} else if arr[mid] > target {
return binarySearch(arr, target, left, mid-1)
} else {
return binarySearch(arr, target, mid+1, right)
}
}
// 5. 树形结构遍历
type TreeNode struct {
Value int
Left *TreeNode
Right *TreeNode
}
func (node *TreeNode) inorderTraversal() {
if node != nil {
node.Left.inorderTraversal()
fmt.Printf("%d ", node.Value)
node.Right.inorderTraversal()
}
}
// 6. 汉诺塔问题
func hanoi(n int, from, to, aux string) {
if n == 1 {
fmt.Printf("移动盘子从 %s 到 %s\n", from, to)
return
}
hanoi(n-1, from, aux, to)
fmt.Printf("移动盘子从 %s 到 %s\n", from, to)
hanoi(n-1, aux, to, from)
}
// 7. 目录遍历模拟
type Directory struct {
Name string
Files []string
Directories []*Directory
}
func (dir *Directory) printStructure(indent string) {
fmt.Printf("%s%s/\n", indent, dir.Name)
for _, file := range dir.Files {
fmt.Printf("%s %s\n", indent, file)
}
for _, subDir := range dir.Directories {
subDir.printStructure(indent + " ")
}
}
func main() {
// 1. 阶乘
fmt.Println("阶乘:")
for i := 0; i <= 5; i++ {
fmt.Printf("%d! = %d\n", i, factorial(i))
}
// 2. 斐波那契数列
fmt.Println("\n斐波那契数列:")
for i := 0; i <= 10; i++ {
fmt.Printf("fib(%d) = %d\n", i, fibonacci(i))
}
// 3. 带记忆化的斐波那契数列
fmt.Println("\n带记忆化的斐波那契数列:")
memo := make(map[int]int)
for i := 0; i <= 10; i++ {
fmt.Printf("fibMemo(%d) = %d\n", i, fibonacciMemo(i, memo))
}
// 4. 二分查找
fmt.Println("\n二分查找:")
arr := []int{1, 3, 5, 7, 9, 11, 13, 15, 17, 19}
target := 7
index := binarySearch(arr, target, 0, len(arr)-1)
if index != -1 {
fmt.Printf("在数组 %v 中找到 %d,索引为 %d\n", arr, target, index)
} else {
fmt.Printf("在数组 %v 中未找到 %d\n", arr, target)
}
// 5. 树形结构遍历
fmt.Println("\n树形结构中序遍历:")
root := &TreeNode{
Value: 4,
Left: &TreeNode{
Value: 2,
Left: &TreeNode{Value: 1},
Right: &TreeNode{Value: 3},
},
Right: &TreeNode{
Value: 6,
Left: &TreeNode{Value: 5},
Right: &TreeNode{Value: 7},
},
}
root.inorderTraversal()
fmt.Println()
// 6. 汉诺塔问题
fmt.Println("\n汉诺塔问题 (3个盘子):")
hanoi(3, "A", "C", "B")
// 7. 目录结构遍历
fmt.Println("\n目录结构:")
rootDir := &Directory{
Name: "root",
Files: []string{"file1.txt", "file2.txt"},
Directories: []*Directory{
{
Name: "subdir1",
Files: []string{"sub1.txt"},
Directories: []*Directory{
{
Name: "subsubdir1",
Files: []string{"subsub1.txt"},
Directories: nil,
},
},
},
{
Name: "subdir2",
Files: []string{"sub2.txt", "sub3.txt"},
Directories: nil,
},
},
}
rootDir.printStructure("")
}
|