ehlxr/hello-algo
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

1. Add C++ codes for the chapter of

Browse Source 
computational complexity, sorting, searching.
2. Corrected some mistakes.
3. Update README.
This commit is contained in:
Yudong Jin
2022-11-27 04:19:16 +08:00
parent f85ee36ce1
commit 431a0f6caf
37 changed files with 147 additions and 94 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
codes/go/chapter_computational_complexity/leetcode_two_sum_test.go
View File

@@ -16,9 +16,8 @@ func TestTwoSum(t *testing.T) {
// ====== Driver Code ======
// 方法一：暴力解法
res := twoSumBruteForce(nums, target)
t.Log("brute force:", res)
t.Log("方法一 res =", res)
// 方法二：哈希表
res = twoSumHashTable(nums, target)
t.Log("hash table:", res)
t.Log("方法二 res =", res)
}

7
codes/go/chapter_searching/linear_search_test.go
View File

@@ -5,8 +5,9 @@
package chapter_searching
import (
. "github.com/krahets/hello-algo/pkg"
"testing"
. "github.com/krahets/hello-algo/pkg"
)
func TestLinearSearch(t *testing.T) {
@@ -15,10 +16,10 @@ func TestLinearSearch(t *testing.T) {
// 在数组中执行线性查找
index := linerSearchArray(nums, target)
t.Log("目标元素 3 的索引 = ", index)
t.Log("目标元素 3 的索引 =", index)
// 在链表中执行线性查找
head := ArrayToLinkedList(nums)
node := linerSearchLinkedList(head, target)
t.Log("目标结点值 3 的对应结点对象为 ", node)
t.Log("目标结点值 3 的对应结点对象为", node)
}

16
codes/go/chapter_tree/binary_search_tree_test.go
View File

@@ -9,33 +9,33 @@ import "testing"
func TestBinarySearchTree(t *testing.T) {
nums := []int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15}
bst := NewBinarySearchTree(nums)
t.Log("初始化的二叉树为: ")
t.Log("初始化的二叉树为:")
bst.Print()
// 获取根结点
node := bst.GetRoot()
t.Log("二叉树的根结点为: ", node.Val)
t.Log("二叉树的根结点为:", node.Val)
// 获取最小的结点
node = bst.GetMin(bst.GetRoot())
t.Log("二叉树的最小结点为: ", node.Val)
t.Log("二叉树的最小结点为:", node.Val)
// 查找结点
node = bst.Search(5)
t.Log("查找到的结点对象为", node, "，结点值 = ", node.Val)
t.Log("查找到的结点对象为", node, "，结点值 =", node.Val)
// 插入结点
node = bst.Insert(16)
t.Log("插入结点后 16 的二叉树为: ")
t.Log("插入结点后 16 的二叉树为:")
bst.Print()
// 删除结点
bst.Remove(1)
t.Log("删除结点 1 后的二叉树为: ")
t.Log("删除结点 1 后的二叉树为:")
bst.Print()
bst.Remove(2)
t.Log("删除结点 2 后的二叉树为: ")
t.Log("删除结点 2 后的二叉树为:")
bst.Print()
bst.Remove(4)
t.Log("删除结点 4 后的二叉树为: ")
t.Log("删除结点 4 后的二叉树为:")
bst.Print()
}

5
codes/go/chapter_tree/binary_tree_bfs_test.go
View File

@@ -5,8 +5,9 @@
package chapter_tree
import (
. "github.com/krahets/hello-algo/pkg"
"testing"
. "github.com/krahets/hello-algo/pkg"
)
func TestLevelOrder(t *testing.T) {
@@ -18,5 +19,5 @@ func TestLevelOrder(t *testing.T) {
// 层序遍历
nums := levelOrder(root)
t.Log("层序遍历的结点打印序列 = ", nums)
t.Log("层序遍历的结点打印序列 =", nums)
}

9
codes/go/chapter_tree/binary_tree_dfs_test.go
View File

@@ -5,8 +5,9 @@
package chapter_tree
import (
. "github.com/krahets/hello-algo/pkg"
"testing"
. "github.com/krahets/hello-algo/pkg"
)
func TestPreInPostOrderTraversal(t *testing.T) {
@@ -18,13 +19,13 @@ func TestPreInPostOrderTraversal(t *testing.T) {
// 前序遍历
nums := preOrder(root)
t.Log("前序遍历的结点打印序列 = ", nums)
t.Log("前序遍历的结点打印序列 =", nums)
// 中序遍历
nums = inOrder(root)
t.Log("中序遍历的结点打印序列 = ", nums)
t.Log("中序遍历的结点打印序列 =", nums)
// 后序遍历
nums = postOrder(root)
t.Log("后序遍历的结点打印序列 = ", nums)
t.Log("后序遍历的结点打印序列 =", nums)
}