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

828 commits

Author SHA1 Message Date
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