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

183 commits

Author SHA1 Message Date
Reanon
20f53e9fc4
feat(go): add iterration/recursion & fix bugs (#698) 2023-08-28 13:35:39 +08:00
krahets
9731a46d67 Fix a definition. 2023-08-27 00:50:18 +08:00
krahets
f524b957d4 Finetune and fix 2023-08-24 17:48:35 +08:00
Reanon
628a274b50
feat(go): support binary search & fix comments (#691) 2023-08-23 21:32:40 +08:00
krahets
f5dda8d99a Polish the content 2023-08-21 03:06:53 +08:00
krahets
2626de8d0b Polish the chapter 
introduction, computational complexity.
 2023-08-20 14:51:39 +08:00
krahets
c310edb672 Polish the chapter of array and linkedlist 2023-08-17 05:13:19 +08:00
krahets
6ef4dc6444 Fix the content 2023-08-10 11:35:16 +08:00
krahets
932d14644d Polish the content 
Polish the chapter preface, introduction and complexity anlysis
 2023-08-08 23:16:33 +08:00
Yudong Jin
71074d88f6
Add the section of binary search insertion. (#671) 
Refactor the section of binary search edge.
Finetune the figures of binary search.
 2023-08-04 05:16:56 +08:00
krahets
6da6d24193 Fix the code of hash map chaining. 2023-08-01 17:05:40 +08:00
Reanon
575bcf58ef
feat(go/tree): support array binary tree (#655) 2023-07-26 11:04:09 +08:00
krahets
35973068a7 Prepare for release 1.0.0b4 2023-07-26 03:15:49 +08:00
krahets
b067016bfa Update preorder_traversal_iii. 2023-07-25 16:39:38 +08:00
krahets
1777a16865 Fix Go comment and link 2023-07-24 13:11:00 +08:00
Reanon
c1adeb2399
feat(go/dp): support dynamic programming (#622) 
* feat(go/dp): support climbing stairs

* feat(go/dp): support knapsack

* feat(go/dp): coin_change & edit_distance
 2023-07-24 03:08:35 +08:00
Reanon
10e5e7499b
feat(go/greedy): add greedy in go code (#648) 2023-07-24 03:06:47 +08:00
Hongyun Zhang
eb695937a4
Add divide and conquer go code (#638) 
* feat: Add Go code to binary search recursion under divide and conquer

* style: Code comment standardization

* style: modify function comment

* fix: fixed error when the list is empty

* Update print_utils.go

* Delete print_utils_test.go

* feat: add Go code to divide and conquer

* Update build_tree.go

* style: modify function name

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-21 22:16:42 +08:00
krahets
bba62bbe75 Fix the code of preorder_traversal_iii_compact 2023-07-21 22:08:26 +08:00
Hongyun Zhang
8068c42688
fixed error when the list is empty (#637) 
* feat: Add Go code to binary search recursion under divide and conquer

* style: Code comment standardization

* style: modify function comment

* fix: fixed error when the list is empty

* Update print_utils.go

* Delete print_utils_test.go

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-21 14:47:37 +08:00
Hongyun Zhang
4e4a13e1bb
feat: Add Go code to binary search recursion under divide and conquer (#630) 
* feat: Add Go code to binary search recursion under divide and conquer

* style: Code comment standardization

* style: modify function comment
 2023-07-20 18:57:28 +08:00
krahets
c54536d1a1 Modify the problem of preorder_traversal_iii 2023-07-19 16:37:12 +08:00
Jerry You
763955aa8b
fix: removeEdge not effects on graph in golang (#503) 
* fix(graph/adjacency_list):removeEdge not effects on graph in golang

* remove unecessary package right now

* Delete go.sum

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-04 21:08:32 +08:00
krahets
54dc288e61 1. Remove Pair class from hash coliision code. 
2. Fix the comment in my_list code.
3. Add a Q&A to the summary of sorting.
 2023-06-26 23:06:15 +08:00
krahets
7876e3e88c Update Go code of subset sum. 2023-06-25 21:59:44 +08:00
Reanon
e4ba690005
feat(go): support new features with go code (#565) 
* feat(go): support hash map chaining

* feat(go): support hash map open address

* feat(go): support simple hash

* feat(go): support top k heap

* feat(go): support subset sum I

* feat(go): support subset sum native

* feat(go): support subset sum II

* fix(go): fix some problem
 2023-06-25 20:51:31 +08:00
krahets
504dff1728 Fix "函数" and "方法" 2023-06-24 16:37:56 +08:00
krahets
9fc1a0b2b3 Update n_queens code. 2023-06-21 02:56:28 +08:00
Yudong Jin
9563965a20
Add the codes of hashmap (#553) 
of chaining and open addressing
 2023-06-14 02:01:06 +08:00
krahets
6377e3316a Fix a comment in my_list.xx 2023-06-03 22:18:28 +08:00
Reanon
5bbcb12979
feat(sort/search): support heap/selection_sort/binary_search_edge in go code (#521) 
* feat(go): support binary search edge and testcase

* feat(go): support selection sort and testcase

* feat(go): support heap sort and testcase

* Update selection_sort_test.go

* Update selection_sort.go

* Update heap_sort.go

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-05-29 12:23:52 +08:00
krahets
6f76203dd9 Fix some mistakes. 2023-05-27 17:13:51 +08:00
krahets
b39e79be85 Fix remove() in binary search tree. 2023-05-26 20:34:22 +08:00
krahets
eb8df49993 Update bubble sort and insertion sort. 2023-05-23 21:20:14 +08:00
krahets
f6d290d903 Update the comments of bubble sort 
and insertion sort
 2023-05-22 23:05:37 +08:00
krahets
d95c628eef Fix the test case of binary search. 2023-05-21 19:29:24 +08:00
krahets
d3cc149c5a Merge the chapter of binary tree and searching. 2023-05-21 19:26:52 +08:00
krahets
c3e7455285 Refactor the section of bianry search. 2023-05-21 04:51:32 +08:00
krahets
399e5df39a Polish some cotents. 2023-05-18 20:27:58 +08:00
krahets
f35020b335 Fix bucket_sort. 2023-05-15 19:54:07 +08:00
ZeYanLin
bae8298c8a
fix:range issue (#496) 2023-05-15 14:57:08 +08:00
Reanon
a6b3f72826
feat(go/backtracking): add go code (#488) 
* feat(go/backtracking): add go code

* feat(backtracking): add n_queens in go

* feat(backtracking): add /preorder_traversal_i_compact in go

* feat(backtracking): add /preorder_traversal_ii_compact in go

* feat(backtracking): add /preorder_traversal_ii_template in go

* feat(backtracking): add preorder_traversal_iii_compact in go

* feat(backtracking): add preorder_traversal_test in go

* feat(backtracking): add permutations_i in go

* feat(backtracking): add permutations_ii in go

* feat(backtracking): add permutation_test in go

* feat(backtracking): fix bug in go

* Update permutations_i.go

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-05-15 01:17:42 +08:00
krahets
fe69f7240d Add figures to replace_linear_by_hashing.md 2023-05-09 00:36:18 +08:00
krahets
de579aa3f4 Fix the file headers. 2023-04-23 19:36:07 +08:00
Yudong Jin
881d573790
Refactor the articles related to searching algorithm. Add the chapter of binary search. Add the section of searching algorithm revisited. (#464) 2023-04-17 18:22:18 +08:00
krahets
f7ae9c8a02 Fix the return type of binary search tree and avl tree 2023-04-14 05:47:20 +08:00
krahets
0bec52d7cc Polish the chapter of heap, introduction, preface. 
Replace "其它" with "其他"
 2023-04-09 19:12:37 +08:00
Yudong Jin
1c8b7ef559
refactor: Replace 结点 with 节点 (#452) 
* Replace 结点 with 节点
Update the footnotes in the figures

* Update mindmap

* Reduce the size of the mindmap.png
 2023-04-09 04:32:17 +08:00
Reanon
cac38c0c93
feat(bucket_sort): add bucket_sort code in go/c (#443) 
* feat(bucket_sort): add bucket_sort code in go/c

* feat(go): add bucket_sort

* feat(c): add bucket_sort in c

* Update bucket_sort_test.go

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-03-30 02:00:17 +08:00
Yudong Jin
34a1bca627
Add the section of radix sort. (#441) 2023-03-26 22:02:37 +08:00