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

910 commits

Author SHA1 Message Date
Yudong Jin
51a4c5089e
feat: Add the chapter of divide and conquer (#609) 
* Add the chapter of divide and conquer.
Add the section of divide and conquer algorithm.
Add the section of build tree problem.

* Update build_tree.py
 2023-07-16 04:24:04 +08:00
Night Cruising
f5ea4fa1c6
feat: add rust codes for avl tree (#605) 
* feat: add rust codes for avl tree

* fix a wrong usage of borrow method of RefCell

* Update avl_tree.rs

* fix comment indentation and field define of TreeNode

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-16 01:32:43 +08:00
sjinzh
b1f8857212
rust and zig : add codes for chapter_dynamic_programming (#606) 
* rust : add codes for chapter_dynamic_programming

* zig : add codes for chapter_dynamic_programming

* rust : add codes for chapter_backtracking

* Update n_queens.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-15 23:16:02 +08:00
hpstory
5c09add1ec
feat(csharp): add csharp code for edit distance (#604) 2023-07-14 13:34:28 +08:00
Night Cruising
c3add62dc7
feat: add rust codes for graph chapter (#598) 
* feat: add rust codes for graph chapter

* update: remove Vertex and it's method to vertex.rs
 2023-07-14 00:47:32 +08:00
hpstory
c9a8b0a9ea
feat(csharp): add csharp code for unbounded knapsack (#596) 2023-07-13 15:49:40 +08:00
Yudong Jin
c3f80e52af
Add the section of edit distance problem (#599) 2023-07-13 05:27:47 +08:00
Night Cruising
f548eae663
feat: add rust codes for bucket sort, counting sort and radix sort (#590) 
* add rust codes for bucket sort, counting sort and radix sort

* update Cargo.toml for build
 2023-07-12 00:29:39 +08:00
sjinzh
6733a4843c
rust : add codes for chapter_backtracking (#594) 
* rust : add codes for chapter_backtracking

* Update subset_sum_ii.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-12 00:01:57 +08:00
NI-SW
c36010b324
add C code for graph (#583) 
* Create chapter_graph

* Delete chapter_graph

* add C code for graph

* add C code for graph

* Create graph_adjacency_list.c

add C code for graph

* Update CMakeLists.txt

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update graph_adjacency_list.c

* Update CMakeLists.txt for c code of graph

* Update format of c code

* Update format of c code

* Update format of c code

* Update verticesList

Change the data structure of the storage list from a linked list to a linear table

* Update graph_adjacency_list.c

* Update graph_adjacency_matrix.c

* Create graph_adjacency_list_test.c

* Create graph_bfs

* Update CMakeLists.txt

* Update graph_adjacency_list.c
 2023-07-11 23:50:51 +08:00
krahets
1c02859b13 Add the section of unbounded knapsack problem. 2023-07-11 19:22:41 +08:00
krahets
ad0fd45cfb Add Java and C++ code for the chapter of DP. 2023-07-11 01:08:26 +08:00
krahets
465dafe9ec Update the text and code of DP. 2023-07-10 20:36:48 +08:00
hpstory
5ea016816a
fix(csharp): fix csharp method name in knapsack (#592) 
* fix(csharp): fix csharp method name in knapsack

* feat(csharp): add csharp code for min path sum

* move INF define into method

* change INF to int max value
 2023-07-10 17:34:54 +08:00
sjinzh
459449d41a
zig : upgrade codes && rust : add codes for chapter_searching and chapter_dynamic_programming. (#591) 
* zig : update zig codes

* rust : add codes for linear_search and hashing_search

* rust : add codes for linear_search and hashing_search

* rust : add codes for chapter_dynamic_programming
 2023-07-10 01:32:12 +08:00
Night Cruising
6c133d42d5
rust code for heap sort (#579) 2023-07-09 03:01:44 +08:00
Yudong Jin
d6cc92614c
add the section of dp solution pipeline (#588) 2023-07-09 02:43:00 +08:00
krahets
cddddb8b8b Update knapsack_problem and intro_to_dp 
Fix avl_tree
 2023-07-09 02:39:58 +08:00
hpstory
cbfb9e59ad
feat(csharp): add csharp code for knapsack (#585) 2023-07-08 05:28:39 +08:00
nuomi1
de4f8378a3
feat: add Swift codes for subset_sum_problem article (#584) 2023-07-08 05:27:40 +08:00
nuomi1
b4de2c0d13
feat: add Swift codes for top_k article (#578) 2023-07-06 03:16:14 +08:00
Yudong Jin
55d8b710fa
Add the section of knapsack problem. (#580) 2023-07-06 00:06:14 +08:00
krahets
470bc10a74 Fix some contents. 2023-07-06 00:04:11 +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
hpstory
bf1bccc1ae
feat(csharp): add csharp code for charper dynamic programming (#574) 
* feat(csharp): add csharp code for charper dynamic programming

* add climbing_stairs_constraint_dp
 2023-07-03 16:44:43 +08:00
nuomi1
87076132e7
feat: add Swift codes for hash_algorithm article (#576) 2023-07-03 16:42:49 +08:00
nuomi1
7f8b0fff54
feat: add Swift codes for hash_collision article (#569) 
* feat: add Swift codes for hash_collision article

* refactor: extract common Pair

* Update hash_map.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-01 20:39:55 +08:00
krahets
69920a0599 Fix binary search. 
Finetune a figure in intro_to_dp.
 2023-07-01 20:07:21 +08:00
krahets
920512d872 Update the section of intro to DP. 2023-07-01 03:02:50 +08:00
krahets
ba481cb8e6 Simplify the python code of bst and avl tree. 2023-06-30 05:17:30 +08:00
krahets
98e797f1fc Fix the bst python code. 
Fitune the chapters name.
 2023-06-30 05:09:17 +08:00
nuomi1
9611a8f135
fix: compiler error and reset root (#570) 2023-06-30 05:05:07 +08:00
Yudong Jin
3f03663d2e
feat: add the section of the introduction to dynamic programming (#571) 
* add the section of the introduction to
dynamic programming

* add a code comments.
 2023-06-30 04:31:43 +08:00
hpstory
4722e7bca7
feat(csharp/hashing): add code and update docs to chapter hashing (#568) 
* feat(csharp/hashing): add code and update docs to chapter hashing

* revert linked list to list
 2023-06-26 23:08:55 +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
WangSL
3b3841ba36
The Rust version of the selection sort. (#524) 
* The Rust version of the selection sort.

* The Rust version of the binary_search_edge

* update，The Rust version of the binary_search_edge and selection_sort

* update，The Rust version of the binary_search_edge and selection_sort

* update The Rust version of the binary_search_edge and selection_sort
 2023-06-25 21:00:24 +08:00
sjinzh
41b7b229a3
upgrade zig codes to 0.11.0-dev.3379+629f0d23b (#563) 
* upgrade zig codes to 0.11.0-dev.3379+629f0d23b

* upgrade zig codes to 0.11.0-dev.3379+629f0d23b
 2023-06-25 20:59:00 +08:00
liuyuxin
62e8f0df50
feat: complete Dart codes for chapter_hashing (#566) 2023-06-25 20:57:37 +08:00
hpstory
ff58d4113c
feat(csharp/backtracking): add subset_sum_i, _ii, _i_naive (#567) 2023-06-25 20:54:58 +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
Yudong Jin
1b1af8d038
Add Java and C++ code for the section hash algorithm (#560) 2023-06-21 19:26:16 +08:00
Yudong Jin
0e2ddba30f
Add the section of subset sum problem. (#558) 2023-06-21 02:58:24 +08:00
krahets
9fc1a0b2b3 Update n_queens code. 2023-06-21 02:56:28 +08:00
krahets
d62156fb58 Fix two_sum.js and .ts 2023-06-16 21:28:48 +08:00
Yudong Jin
29e6617ec1
Add the section of hash algorithm. Refactor the section of hash map. (#555) 2023-06-16 21:20:57 +08:00
hpstory
8334df1b2b
feat(csharp): add top_k (#554) 2023-06-14 18:49:42 +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
d3e597af94 Update cmakelists.txt 2023-06-13 21:16:54 +08:00
Yudong Jin
a111b94f23
feat: Add the section of Top-K problem (#551) 
* Add the section of Top-K problem

* Update my_heap.py

* Update build_heap.md

* Update my_heap.py
 2023-06-12 23:04:01 +08:00
krahets
0345a479a4 Fix some codes. 2023-06-06 02:03:27 +08:00
krahets
698c2e7fe5 Fix some codes and a figure. 2023-06-05 01:03:39 +08:00
Justin Tse
2532f06c7f
Add JavaScript and TypeScript code of heap sort, selection sort and binary search edge and Fix the indentation of TS code (#545) 
* Fix the indentation of TS code

* Add JavaScript and TypeScript code of heap sort, selection sort and binary search edge

* Fix the style of JS and TS code
 2023-06-05 00:20:11 +08:00
krahets
6377e3316a Fix a comment in my_list.xx 2023-06-03 22:18:28 +08:00
liuyuxin
d0b1bf9b1a
Update two_sum.dart (#544) 2023-06-02 20:23:27 +08:00
liuyuxin
281c0c618a
feat: modify some Dart codes and add Dart code blocks to the docs (#543) 2023-06-02 14:56:29 +08:00
liuyuxin
53e18bc6d6
feat: complete dart code for chapter_searching and chapter_sorting (#526) 2023-06-02 02:52:10 +08:00
gonglja
86209e0a7b
feat: Add C codes for bucket sort, heap sort, selection sort, binary search edge (#525) 
* 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

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-06-02 02:51:35 +08:00
Yudong Jin
025051c81b
Add Dart codes to the documents. (#529) 2023-06-02 02:40:26 +08:00
hpstory
671fbc84ee
feat(csharp): add binary_search_edge, heap_sort, selection_sort (#527) 2023-06-01 18:52:18 +08:00
krahets
e35e2e31eb Add the figure of assembling blocks. 
Update some texts.
 2023-05-31 01:04:40 +08:00
liuyuxin
8247a611d7
Update Dart code to output same as Java (#522) 2023-05-30 13:00:16 +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
nuomi1
56a4385202
feat: add Swift codes for heap_sort article (#520) 2023-05-29 12:20:32 +08:00
nuomi1
8bed60f0d7
feat: add Swift codes for selection_sort article (#519) 2023-05-28 17:51:35 +08:00
nuomi1
4ce20f6bbc
feat: add Swift codes for binary_search_edge article (#518) 2023-05-28 17:26:09 +08:00
krahets
6f76203dd9 Fix some mistakes. 2023-05-27 17:13:51 +08:00
krahets
fb72aa385e Polish some texts. 2023-05-26 20:34:48 +08:00
krahets
b39e79be85 Fix remove() in binary search tree. 2023-05-26 20:34:22 +08:00
Yudong Jin
ee716a2c23
feat: Add the section of heap sort. (#516) 
* Add the section of heap sort.

* Update heap_sort.cpp
 2023-05-26 04:46:56 +08:00
krahets
11c835d79c Update the section of heap. 2023-05-25 20:25:19 +08:00
krahets
dc49fdf75e Polish some contents. 2023-05-24 11:45:52 +08:00
Yudong Jin
77b4f4c400
Add the section of selection sort. (#513) 2023-05-24 00:35:46 +08:00
krahets
5dff1bd0e8 Update the insertion sort. 2023-05-24 00:33:27 +08:00
krahets
eb8df49993 Update bubble sort and insertion sort. 2023-05-23 21:20:14 +08:00
xBLACKICEx
abecea9ab6
✨feat(rust/tree): add binary_search_tree (#481) 
* ✨ feat(rust/tree): add binary_tree_dfs

* ✨ feat(rust/tree): add binary_tree_bfs

* 🐞 fix(rust/tree): can't list to any kind of tree

* ✨feat(rust/tree): add binary_search_tree

* Update binary_search_tree.rs

* 🐞 fix(rust/tree): corret writing mistakes

* 🦄 refactor(rust/tree): remove get_next_node() function

* Update binary_search_tree.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-05-23 15:42:08 +08:00
krahets
89a9741e9e Fix some comments. 2023-05-22 23:13:54 +08:00
krahets
f6d290d903 Update the comments of bubble sort 
and insertion sort
 2023-05-22 23:05:37 +08:00
krahets
5b406666d8 Polish the content 2023-05-22 22:04:31 +08:00
krahets
e196962d0a Simplify the declarations of the Python code. 2023-05-22 22:03:57 +08:00
krahets
24d90931e3 Update the callouts for the algorithm problems. 2023-05-21 19:58:21 +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
Yudong Jin
b5eb9ca271
feat: Add the section of binary search edge. (#508) 
* Add the section of binary search edge.

* Delete binary_search_rotation.py
 2023-05-21 19:04:21 +08:00
krahets
c3e7455285 Refactor the section of bianry search. 2023-05-21 04:51:32 +08:00
Jefferson Huang
921d87c238
feat: add chapter_binary_search by dart (#506) 
* feat: add chapter_sorting by dart

* feat: add chapter_searching by dart

* feat: add chapter_binary_search by dart

---------

Co-authored-by: huangjianqing <huangjianqing@52tt.com>
 2023-05-21 02:31:15 +08:00
krahets
399e5df39a Polish some cotents. 2023-05-18 20:27:58 +08:00
Jefferson Huang
335bc29af2
feat: add chapter_sorting and chapter_searching by dart (#497) 
* feat: add chapter_sorting by dart

* feat: add chapter_searching by dart

---------

Co-authored-by: huangjianqing <huangjianqing@52tt.com>
 2023-05-18 19:05:48 +08:00
liuyuxin
ec4202031e
feat: add dart code for chapter_graph (#498) 2023-05-18 19:04:39 +08:00
krahets
817b4598d5 Fix a comment in binary_search_tree code 2023-05-17 19:04:46 +08:00
krahets
b093162208 Fix my_list.py 2023-05-17 04:46:55 +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
nuomi1
170713c642
feat: add Swift codes for n_queens_problem article (#495) 
* refactor: rename PreorderTraversalIIITemplate

* feat: add Swift codes for n_queens_problem article
 2023-05-15 01:13:17 +08:00
krahets
649d8c4c86 Fix the indentation of JS and TS code. 2023-05-14 01:40:19 +08:00
liuyuxin
541f384e7c
Fix function call error and null safety (#491) 2023-05-14 01:19:06 +08:00
Justin Tse
b52a98f178
Add JavaScript and TypeScript code of permutations and n_queens (Chapter of Backtracking) (#494) 
* Add JavaScript and TypeScript code of permutations and n_queens (Chapter of Backtracking)

* Update n_queens.js

* Update permutations_i.js

* Update permutations_ii.js

* Update n_queens.ts

* Update permutations_i.ts

* Update permutations_ii.ts

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-05-14 01:18:40 +08:00
Justin Tse
01345c23ca
Add JavaScript and TypeScript code of preorder traversal (Chapter of Backtracking) (#490) 
* Add JavaScript and TypeScript code of preorder traversal (Chapter of Backtracking)

* Update preorder_traversal_iii_compact.ts
 2023-05-11 23:46:12 +08:00