29e6617ec1
Add the section of hash algorithm. Refactor the section of hash map. ( #555 )
2023-06-16 21:20:57 +08:00
8334df1b2b
feat(csharp): add top_k ( #554 )
2023-06-14 18:49:42 +08:00
9563965a20
Add the codes of hashmap ( #553 )
...
of chaining and open addressing
2023-06-14 02:01:06 +08:00
d3e597af94
Update cmakelists.txt
2023-06-13 21:16:54 +08:00
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
0345a479a4
Fix some codes.
2023-06-06 02:03:27 +08:00
698c2e7fe5
Fix some codes and a figure.
2023-06-05 01:03:39 +08:00
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
6377e3316a
Fix a comment in my_list.xx
2023-06-03 22:18:28 +08:00
d0b1bf9b1a
Update two_sum.dart ( #544 )
2023-06-02 20:23:27 +08:00
281c0c618a
feat: modify some Dart codes and add Dart code blocks to the docs ( #543 )
2023-06-02 14:56:29 +08:00
53e18bc6d6
feat: complete dart code for chapter_searching and chapter_sorting ( #526 )
2023-06-02 02:52:10 +08:00
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
025051c81b
Add Dart codes to the documents. ( #529 )
2023-06-02 02:40:26 +08:00
671fbc84ee
feat(csharp): add binary_search_edge, heap_sort, selection_sort ( #527 )
2023-06-01 18:52:18 +08:00
e35e2e31eb
Add the figure of assembling blocks.
...
Update some texts.
2023-05-31 01:04:40 +08:00
8247a611d7
Update Dart code to output same as Java ( #522 )
2023-05-30 13:00:16 +08:00
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
56a4385202
feat: add Swift codes for heap_sort article ( #520 )
2023-05-29 12:20:32 +08:00
8bed60f0d7
feat: add Swift codes for selection_sort article ( #519 )
2023-05-28 17:51:35 +08:00
4ce20f6bbc
feat: add Swift codes for binary_search_edge article ( #518 )
2023-05-28 17:26:09 +08:00
6f76203dd9
Fix some mistakes.
2023-05-27 17:13:51 +08:00
fb72aa385e
Polish some texts.
2023-05-26 20:34:48 +08:00
b39e79be85
Fix remove() in binary search tree.
2023-05-26 20:34:22 +08:00
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
11c835d79c
Update the section of heap.
2023-05-25 20:25:19 +08:00
dc49fdf75e
Polish some contents.
2023-05-24 11:45:52 +08:00
77b4f4c400
Add the section of selection sort. ( #513 )
2023-05-24 00:35:46 +08:00
5dff1bd0e8
Update the insertion sort.
2023-05-24 00:33:27 +08:00
eb8df49993
Update bubble sort and insertion sort.
2023-05-23 21:20:14 +08:00
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
89a9741e9e
Fix some comments.
2023-05-22 23:13:54 +08:00
f6d290d903
Update the comments of bubble sort
...
and insertion sort
2023-05-22 23:05:37 +08:00
5b406666d8
Polish the content
2023-05-22 22:04:31 +08:00
e196962d0a
Simplify the declarations of the Python code.
2023-05-22 22:03:57 +08:00
24d90931e3
Update the callouts for the algorithm problems.
2023-05-21 19:58:21 +08:00
d95c628eef
Fix the test case of binary search.
2023-05-21 19:29:24 +08:00
d3cc149c5a
Merge the chapter of binary tree and searching.
2023-05-21 19:26:52 +08:00
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
c3e7455285
Refactor the section of bianry search.
2023-05-21 04:51:32 +08:00
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
399e5df39a
Polish some cotents.
2023-05-18 20:27:58 +08:00
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
ec4202031e
feat: add dart code for chapter_graph ( #498 )
2023-05-18 19:04:39 +08:00
817b4598d5
Fix a comment in binary_search_tree code
2023-05-17 19:04:46 +08:00
b093162208
Fix my_list.py
2023-05-17 04:46:55 +08:00
f35020b335
Fix bucket_sort.
2023-05-15 19:54:07 +08:00
bae8298c8a
fix:range issue ( #496 )
2023-05-15 14:57:08 +08:00
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
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
