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

2038 commits

This branch
This branch
All branches
Author SHA1 Message Date
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
3d81b2d954 Update the opening phrase 2023-08-04 05:13:20 +08:00
gonglja
9900e0c668
Add array_binary_tree.c and update push_back and pop_back in vector.h (#664) 
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

* fix(codes/c): Fix space_complexity.c build error.

* feat(codes/c): Add array_binary_tree.c

* feat(code/c): Update push_back and pop_back in vector.h

* styles(codes/c): Adjust  format.

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-08-03 14:48:10 +08:00
William Yuan
70784a1ec3
feat(chapter_backtracking): Add js and ts codes for chapter 13.3 (#667) 
* feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1

* style(chapter_dynamic_programming): format code

* refactor(chapter_dynamic_programming): remove main definition and add type

* feat(chapter_backtracking): Add js and ts codes for chapter 13.3

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.2

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.3

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.4

* style(chapter_divide_and_conquer): fix typo

* refactor: Use === instead of == in js and ts
 2023-08-03 14:44:49 +08:00
krahets
c7c33f19ac Update the opening phrase 2023-08-03 05:16:40 +08:00
Yudong Jin
43ed0e41d6
Add opening phrase for every chapters. (#670) 
Update several chapter covers.
Fitune documens.
 2023-08-03 04:40:29 +08:00
krahets
6da6d24193 Fix the code of hash map chaining. 2023-08-01 17:05:40 +08:00
krahets
55615ab61d Update basic_data_types.md 2023-07-31 20:24:48 +08:00
Bubble9um
a14f04e807
Update summary.md (#669) 
小结倒数第二条中 MD5常用语 更改为 常用于
 2023-07-31 19:07:07 +08:00
nuomi1
a54ec55516
fix: break reference cycling (#666) 2023-07-31 03:32:19 +08:00
krahets
dbe3b4d6ba Fine tune. 2023-07-31 03:27:26 +08:00
gonglja
f7b827b303
Fix space_complexity.c build error. (#663) 
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

* fix(codes/c): Fix space_complexity.c build error.

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-29 18:21:47 +08:00
gonglja
8f5ef68c65
feat: Add C codes for the chapter backtracking (#593) 
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

* feat(codes/c): Add part of the c code in the backtracking chapter

* feat(codes/c): Add preorder_traversal_iii_compact.c

* feat(codes/c): Add preorder_traversal_iii_template.c

* feat(codes/c): Add permutations_i.c

* style(codes/c): Adjust the format

* feat(codes/c): Add memory release in chapter_backtracking

* fix(codes/c): Fix memory release issue.

* style(codes/c): Update format and Merge duplicate code

* style(code/c): Change print format in preorder_traversal_iii_template.c

* Update preorder_traversal_iii_template.c

* Update permutations_i.c

* feat(codes/c): Remove myArray, use public vector.

* feat(codes/c): Add subset_sum_i_naive.c in C codes.

* feat(codes/c): Add permutations_i in CMakeLists.txt

* feat(codes/c): Update printf function in vector.h.

* feat(codes/c): Add subset_sum_i.c and subset_sum_ii.c

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-29 15:14:01 +08:00
krahets
9e8aee04d5 Update number_encoding.md 
Update the width of cover images.
 2023-07-29 04:50:49 +08:00
krahets
c9ec4c2625 Fix greedy_algorithm.md 
Add a new Q&A
 2023-07-29 02:09:55 +08:00
yishangzhang
fc63e990c8
fix: Object pointer not deleted (#662) 
* fix: Object pointer not deleted

*  codes/cpp/chapter_hashing

Signed-off-by: yishangzhang <zhangyi2017@cug.edu.cn>

* Update hash_map_chaining.cpp

---------

Signed-off-by: yishangzhang <zhangyi2017@cug.edu.cn>
Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-29 02:08:00 +08:00
William Yuan
35e9c8c209
feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1 (#658) 
* feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1

* style(chapter_dynamic_programming): format code

* refactor(chapter_dynamic_programming): remove main definition and add type
 2023-07-29 02:06:11 +08:00
WangSL
13bb76c283
feat: add rust code for build_in_hash and hash_collision (#629) 
* Create hash_map_chaining.rs

* Create hash_map_open_addressing.rs

* Create build_in_hash.rs

* Update Cargo.toml
 2023-07-26 15:42:47 +08:00
krahets
b9b324b298 Use abbreviation for JavaScript and TypeScript 2023-07-26 15:35:38 +08:00
krahets
85d12360ed Prepare 1.0.0b4 release. 2023-07-26 11:56:32 +08:00
Reanon
575bcf58ef
feat(go/tree): support array binary tree (#655) 2023-07-26 11:04:09 +08:00
Yudong Jin
027bdd6510
Release Rust code to documents. (#656) 2023-07-26 11:00:53 +08:00
krahets
60162f6fa8 Finetune Rust code. 2023-07-26 10:01:49 +08:00
Night Cruising
06006c58a2
feat: add rust codes for array binary tree (#654) 
* feat: add rust codes for array binary tree

* update tree_node.rs

* update: add implementation of vec_to_tree and tree_to_vec

* update tree_node.rs

* Update tree_node.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-26 09:15:58 +08:00
krahets
63a0e73df0 Unify punctuation. 2023-07-26 08:59:36 +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
90af225dae Remove -> None for Python functions 2023-07-24 22:34:05 +08:00
gonglja
ac0f405f9a
Fix quadraticRecur bug in space_complexity.c (#651) 
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

* fix(codes/c): Fix quadraticRecur bug in `space_complexity.c`

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-24 22:29:13 +08:00
Night Cruising
fdbe275fc9
fix: check the rust codes and fix them (#653) 
* fix: check the rust codes and fix it

* Update binary_tree_bfs.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-24 22:27:26 +08:00
hpstory
978d3c2ed7
fix(csharp): reformat csharp codes and docs (#652) 
* fix(csharp): reformat the C# codes and docs

* Update time_complexity.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-24 19:50:00 +08:00
krahets
1777a16865 Fix Go comment and link 2023-07-24 13:11:00 +08:00
nuomi1
9ab4b0b15c
Feature/array representation of tree swift (#649) 
* refactor: encode & decode Tree

* style: build warning

* feat: add Swift codes for array_representation_of_tree article
 2023-07-24 12:46:48 +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
Night Cruising
41db3701ab
Update max_product_cutting.java (#647) 2023-07-24 03:05:57 +08:00
krahets
17f995b432 Finetune the chapter of hashing, 
divide and conquer, backtracking, tree
 2023-07-24 03:04:55 +08:00
Night Cruising
9d56622c75
feat: add rust codes for chapter greedy (#646) 
* feat: add rust codes for chapter greedy

* Update max_product_cutting.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-22 20:35:57 +08:00
krahets
abec926c24 Finetune the documents. 
Update mindmap.
Add the cover image of chapter appendix.
 2023-07-22 04:29:08 +08:00
hpstory
b43de88f71
feat(csharp): add csharp code for charper greedy (#645) 2023-07-22 02:54:41 +08:00
krahets
c9daeeff2d Add the section of summary of greedy. 2023-07-21 22:54:26 +08:00
krahets
e114ea2b65 Finetune the docments 2023-07-21 22:21:33 +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
William Yuan
b676349dac
Update hash_map.md (#641) 2023-07-21 22:15:46 +08:00
krahets
bba62bbe75 Fix the code of preorder_traversal_iii_compact 2023-07-21 22:08:26 +08:00
Yudong Jin
075c3abf88
Add the section of max product cutting problem. (#642) 2023-07-21 21:56:14 +08:00
krahets
ca5bde2b6c Add subtitles to docs 2023-07-21 21:54:51 +08:00
krahets
1a55dbdf2e Finetune doc and code. 2023-07-21 15:18:01 +08:00
Yudong Jin
76f11ae168
Add the section of max capacity problem. (#639) 2023-07-21 15:16:51 +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