xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-26 15:06:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions
1779 commits 5 branches 9 tags 383 MiB
Commit graph

207 commits

Author SHA1 Message Date
Yudong Jin
b39b84acba Update avl_tree 2023-02-03 18:58:01 +08:00
Yudong Jin
70dead5cd0 Update worst_best_time_complexity, 
leetcode_two_sum
 2023-02-03 18:53:15 +08:00
Yudong Jin
2da45041b1 Update binary_search_tree 2023-02-02 13:54:31 +08:00
Yudong Jin
7d14c9440e Unify the function naming of 
queue from `offer()` to `push()`
 2023-02-02 01:43:01 +08:00
Yudong Jin
5eae708035 Fix array queue. 2023-02-01 03:23:29 +08:00
Yudong Jin
ddd5562b60 Fix the index out of bound check in my_list. 2023-01-30 17:50:07 +08:00
reanon
83faceb4b5 feat(sort/radix_sort): add go codes 2023-01-18 14:41:31 +08:00
龚国玮
1cb6e25cfe fix(go): linked list test name is misspelled 2023-01-17 09:57:50 +08:00
Yudong Jin
2336fe1d50 Update the comments in 
binary_search_tree and avl_tree.
 2023-01-17 01:53:12 +08:00
Yudong Jin
a099e5954f
Merge pull request #260 from Reanon/feat-c-tree 
feat(tree): add C codes to avl_tree/binary_search_tree.
 2023-01-17 00:35:39 +08:00
Yudong Jin
592e82818c Update a comment in my_heap. 2023-01-16 19:30:54 +08:00
reanon
00009c8e49 feat(tree): add go codes 2023-01-16 10:20:56 +08:00
Yudong Jin
b716359c99 Merge branch 'master' of github.com:krahets/hello-algo 2023-01-15 23:33:05 +08:00
Yudong Jin
5f0ae848c4 Update medianThree() in quick_sort. 2023-01-15 23:32:58 +08:00
Gaosong
811f15cf3c fix: polling from an empty heap will cause panic 2023-01-15 11:50:04 +08:00
reanon
ec28b4ce7a fix(heap): add go codes 2023-01-13 17:41:22 +08:00
reanon
3dcdd1c72d fix(heap): add go codes 2023-01-13 17:38:03 +08:00
reanon
264a2ab6bc docs(heap): add go codes 2023-01-13 17:38:03 +08:00
reanon
8117a1d47d fix(heap): fix go code 2023-01-13 17:38:03 +08:00
reanon
79d51e3691 fix(heap): fix go code 2023-01-13 17:38:03 +08:00
reanon
32962fb7a1 feat(heap): add go codes 2023-01-13 17:38:03 +08:00
reanon
8723ca1469 feat(tree): add C codes 2023-01-11 01:56:08 +08:00
Yudong Jin
daa28be3e4
Merge branch 'master' into binary_search_tree 2023-01-10 13:30:38 +08:00
Yudong Jin
d6d6a16c7e Update the access() function of linked_list 2023-01-10 00:46:04 +08:00
Yudong Jin
5c943471c7
Merge pull request #220 from Reanon/bugfix/fix-go-code-style 
style(go): fix go code style
 2023-01-09 02:16:12 +08:00
reanon
388509a842 docs(tree/avl_tree): add go code 2023-01-09 01:13:29 +08:00
reanon
cb0071924e feat(tree/avl_tree): add go code 2023-01-09 01:13:29 +08:00
reanon
33e2c4f4d3 fix(tree): fix ArrToTree in go code 2023-01-08 20:33:30 +08:00
reanon
b73ac7bf4b style(go): fix go code style 
Make the classes and methods in the package private, in case misuse
 2023-01-08 20:33:30 +08:00
Yudong Jin
dcc3b2e35b Optimize arrToTree function 
in java, cpp, py, go, js, ts.
 2023-01-08 19:03:22 +08:00
Yudong Jin
30b4ab6ba7 Update array (Go). 2023-01-06 03:28:27 +08:00
Yudong Jin
410c5d6b62 Free memory after removing 
a node from a LinkedList or TreeNode.
 2023-01-02 19:53:55 +08:00
Yudong Jin
6b02449f22 Update the chapter sorting (Go code). 2023-01-02 19:09:46 +08:00
Yudong Jin
5cb62fd458 Update the array (Go code). 2023-01-02 19:03:36 +08:00
Yudong Jin
1f1c58519d Update the array and linked list (Go code). 2023-01-02 18:59:35 +08:00
Yudong Jin
82b8a5da39
Merge branch 'master' into master 2023-01-02 18:53:33 +08:00
Yudong Jin
bacf8553c5
Update linked_list.go 2023-01-02 18:42:58 +08:00
GN-Yu
5d45f71167
Update merge_sort.go 2022-12-30 13:21:40 -05:00
Yudong Jin
0950e43fd7
Merge pull request #178 from guowei-gong/gongguowei 
docs(array): sample code for golang
 2022-12-30 16:46:18 +08:00
Yudong Jin
ae78126d80
Update array.go 2022-12-30 16:44:09 +08:00
陈国太
cd9f4fc35d fix(array and linkedlist): fix that the printing in the test function is the same as that in other languages 2022-12-29 21:49:46 +08:00
Cathay
1faad9e187 Merge branch 'master' of github.com:Cathay-Chen/hello-algo 2022-12-29 17:43:34 +08:00
Cathay
1062fe64a3 feat(linked_list): add the Go code to linked_list docs (Chapter of Array and LinkedList) 2022-12-29 17:43:16 +08:00
龚国玮
a5e923a387 test(binary_search_tree): update test param 
use param value 7, not 5, function test param value with param value in example picture as same.
 2022-12-29 14:44:15 +08:00
Cathay
b3e3aa1e72
Merge branch 'krahets:master' into master 2022-12-29 13:27:03 +08:00
Cathay
c0e8b75bfd feat(array): add the Go code to array docs (Chapter of Array and LinkedList) 2022-12-29 13:26:09 +08:00
龚国玮
4fb267918b docs(array): add file author, created time 2022-12-29 10:06:11 +08:00
龚国玮
f0c3bf5766 docs(array): reduce understanding cost 
- 去除了并行测试；
- 基于 Java 代码样例，统一了命名风格；
- 基于 Go link 模块代码样例，统一了测试用例风格；
- 我们将 Go 中的 Slice 切片看作 Array 数组。因为这样可以降低理解成本，利于我们将关注点放在数据结构与算法上。
 2022-12-28 10:46:12 +08:00
龚国玮
b1be0aab15 docs(array): sample code for golang 
本次提交包含如下示例代码。
- 遍历数组；
- 初始化数组；
- 扩展数组长度；
- 在数组中查找指定元素；
- 随机返回一个数组元素；
- 删除索引 index 处元素；
- 在数组的索引 index 处插入元素 num。

所有数组约定长度为 5。原因如下：
在 goalng 中，必须声明数组的长度，例如：nums := [5]int{1,2,3,4,5}。如果不声明长度，则被称为切片。

使用的注释没有按照 golang 的编程惯例，而是倾向于使用文档上下文的注释约定。
所以所有函数注释均使用了 `/* ... */`，而不是双斜杠 `//`。
 2022-12-27 11:25:30 +08:00
Yudong Jin
f8748e6006 Update space complexity. 2022-12-26 13:14:32 +08:00
Yudong Jin
01b6c8bb0a Fix my list. 2022-12-25 12:58:35 +08:00
Yudong Jin
f3ef226874 Remove the spaces between “ ” and 中文 aside. 2022-12-21 01:37:58 +08:00
machangxin
4fa41ce08a fixed clear list in Go 2022-12-18 21:57:29 +08:00
machangxin
c5f7faaf15 list using go 2022-12-18 14:55:14 +08:00
machangxin
2305b09db4 Supplement linear_search documentation 2022-12-17 15:14:38 +08:00
machangxin
e0721dde05 function PrintSlice supports Generics 2022-12-17 14:59:21 +08:00
machangxin
ba5b5a1f09 function PrintMap supports Generics 2022-12-16 17:03:41 +08:00
machangxin
26ad485dd2 Add function PrintMap() in Go 2022-12-16 10:55:28 +08:00
马赛克
e432f0b987
Merge branch 'krahets:master' into master 2022-12-16 09:18:48 +08:00
Yudong Jin
c071ab88d2 Update hash map 2022-12-15 23:08:07 +08:00
Cathay
5617f8246f feat(space_complexity): add the Go code to space complexity docs (Chapter of Computational Complexity) 2022-12-15 16:41:47 +08:00
machangxin
1229f98e92 Fixed some problems, indentation and Pointer 2022-12-15 09:43:20 +08:00
machangxin
aeb4e6077d Add C++, Python, Go code for chapter_hashing 2022-12-14 17:18:32 +08:00
machangxin
8ff1e32426 update annotation 2022-12-13 23:50:49 +08:00
Yudong Jin
bec787b751 Update time complexity and space complexity. 2022-12-13 23:24:12 +08:00
Yudong Jin
f0c6de961a Update the chapter of time complexity. 2022-12-13 23:23:24 +08:00
Yudong Jin
d2d7560aad Update merge_sort.go 2022-12-13 22:46:23 +08:00
machangxin
1ec97120a9 add worst_best_time_complexity.go 2022-12-13 17:53:23 +08:00
machangxin
4d3128a4a7 merge sort using go 2022-12-13 14:24:17 +08:00
machangxin
7dc1dd54d4 Add annotation 2022-12-13 09:53:17 +08:00
machangxin
d4ad75eb7d time complexity using go 2022-12-13 09:24:59 +08:00
Yudong Jin
a5b473f718
Merge pull request #96 from Slone123c/patch 
Hashing search and test using go
 2022-12-13 00:21:38 +08:00
chenshilong
bb24e8083a 1. Code formatted 2022-12-12 23:17:33 +08:00
Yudong Jin
e4f202b993 Update Go code of quick sort. 2022-12-12 23:12:05 +08:00
Yudong Jin
7c34e5b268 Merge branch 'master' of github.com:krahets/hello-algo 
merge
 2022-12-12 23:09:48 +08:00
machangxin
e862a06c4c Quick sort using go 2022-12-12 21:33:53 +08:00
Yudong Jin
d612bea748 Fix the Go code of insertion sort. 2022-12-12 20:03:34 +08:00
machangxin
e2ae907cd1 Insertion sort using go 2022-12-12 18:50:22 +08:00
machangxin
51a6f374a7 Insertion sort using go 2022-12-12 18:32:58 +08:00
chenshilong
c5e5be07b8 1. Hashing search and test using go 2022-12-12 16:41:41 +08:00
chenshilong
78901d8689 1. Hashing search and test using go 2022-12-12 16:36:29 +08:00
chenshilong
8643efece9 1.bubble sort using go 
2.test edited
 2022-12-07 18:38:12 +08:00
chenshilong
10b1216675 bubble sort using go 2022-12-06 23:41:12 +08:00
Yudong Jin
1f24a7c75d
Update binary_search_test.go 2022-12-05 22:32:56 +08:00
Yudong Jin
bb00bb8620
Update binary_search.go 2022-12-05 22:32:08 +08:00
Slone
27e993e6df
binary_search_test_ edited time 2022-12-05 20:45:46 +08:00
Slone
829e13494e
binary_search.go and binary_search_test uploaded 2022-12-05 20:39:42 +08:00
Yudong Jin
ebf9024136 Add Go codes to docs, including 
the chapter of stack and queue, the chapter of tree.
 2022-12-03 20:25:24 +08:00
Yudong Jin
e20bc251f5 Add python code of chapter queue to docs. 2022-12-02 00:09:34 +08:00
reanon
a554590fa8 feat(deque): add implementation of deque 2022-11-29 10:46:25 +08:00
reanon
19469aecbf fix(go): modify interface of stack, queue and deque 2022-11-29 10:44:31 +08:00
reanon
d32f15feb1 fix(testcase): modify testcase 2022-11-29 10:44:31 +08:00
reanon
bed8b07b0b feat(deeue): implement deque in golang code 2022-11-29 10:44:31 +08:00
reanon
76a7e0b232 feat(queue): implement queue in golang code 2022-11-29 10:44:31 +08:00
reanon
27e4402eca feat(stack): implement stack in golang code 2022-11-29 10:44:31 +08:00
reanon
67409cdb12 fix(tree): amend tree in golang 2022-11-29 10:44:31 +08:00
Yudong Jin
431a0f6caf 1. Add C++ codes for the chapter of 
computational complexity, sorting, searching.
2. Corrected some mistakes.
3. Update README.
 2022-11-27 04:19:16 +08:00
reanon
913cf38d0b fix(tree): make go code as consistent as possible with java code 2022-11-26 16:32:34 +08:00
reanon
e62d663630 feat(tree): add binary tree dfs in golang 2022-11-26 14:39:30 +08:00
reanon
0f89475e0e feat(tree): add binary tree bfs in golang 2022-11-26 14:38:38 +08:00
reanon
2e72ce8eeb feat(tree): add binary search tree in golang 2022-11-26 13:25:13 +08:00
reanon
db5ca936b6 feat(tree): add binary tree in golang 2022-11-26 13:24:35 +08:00
reanon
fae6c6ac5b fix(pkg): amend tree node 2022-11-26 11:18:31 +08:00
reanon
aa7a32efe0 fix(go): fix support basic pkg 2022-11-26 01:17:48 +08:00
reanon
07a359484b feat(go): support basic pkg 2022-11-25 20:24:51 +08:00
Yudong Jin
daf25d5e64 Add python codes and for the chapter of 
computational complexity.
Update Java codes.
Update Contributors.
 2022-11-25 20:12:20 +08:00
reanon
09d89dc9ad feat(chapter1): add go code to chapter1 
1.add go code to chapter_computational_complexity
2.add go code to space_time_tradeoff.md
3. Indentation of Go code is tab in *.go , 4 spaces in *.md
 2022-11-25 09:10:27 +08:00