Commit graph

1746 commits

Author SHA1 Message Date
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
krahets
200275b39a Update index.md
Add the code to hash_algorithm.md
2023-07-03 16:56:42 +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
krahets
9b15072a85 Update the chapter of DP. 2023-07-03 16:35:37 +08:00
krahets
067e9d4fd1 Update intro_to_dp 2023-07-02 03:56:40 +08:00
krahets
663ac70064 Divide the intro_to_dp into two sections. 2023-07-01 22:38:20 +08:00
krahets
1113d03a8f Add new Q&As. 2023-07-01 22:37:26 +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
d8b2eb1a32 Fix the introduction to DP. 2023-07-01 05:02:01 +08:00
krahets
1804f8759e Update the figures in algorithms_are_everywhere. 2023-07-01 04:43:55 +08:00
krahets
92d165cfcc Modify the chapter names.
Fix the definition of algorithm.
Update the buttons in the landing page.
2023-07-01 03:03:42 +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
krahets
be8912073e Collapse the navigation by default 2023-06-30 04:49:03 +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
krahets
3902ccbfc7 Fine-tune the docs. 2023-06-25 21:11:24 +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
Sizhuo Long
efc1c2f49f
add Q&A of hashing, heap, sorting and tree chapter (#564)
* add`Q&A` of `stack_and_queue` chapter

* Update summary.md

* Update summary.md

* add`Q&A` of `hashing` chapter

* add`Q&A` of `hashing` chapter

* add`Q&A` of `hashing` chapter

* add`Q&A` of `tree` chapter

* add`Q&A` of `heap` chapter

* Update summary.md

* add`Q&A` of `sorting` chapter

* Update summary.md

* Update summary.md

* Update summary.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-06-25 20:50:20 +08:00
krahets
504dff1728 Fix "函数" and "方法" 2023-06-24 16:37:56 +08:00
Yudong Jin
674ff2910a
Add the summary of backtracking (#561) 2023-06-22 00:22:15 +08:00
Yudong Jin
6519653b8f
Update README.md 2023-06-21 20:05:21 +08:00
krahets
d57469e2b8 Update slogan 2023-06-21 19:39:15 +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
Yudong Jin
ba1e5c1d7d
Update README.md 2023-06-19 05:59:30 +08:00
Yudong Jin
8a39c5ceaf
Update README.md (#557) 2023-06-19 05:54:38 +08:00
Yudong Jin
cd74dd13b7
Update README.md 2023-06-19 05:41:08 +08:00
krahets
fd8b9ce853 Update README and the landing page. 2023-06-19 05:34:41 +08:00
krahets
c070d9f933 Update the landing page and README.
Add a example to algorithms_are_everywhere.md.
2023-06-18 04:39:20 +08:00
krahets
b6b03ef84b Fix the figures of binary tree.
Replace null with None.
2023-06-17 00:45:41 +08:00
krahets
73372ad35a Update the summary of hashing chapter. 2023-06-16 21:50:23 +08:00
krahets
d62156fb58 Fix two_sum.js and .ts 2023-06-16 21:28:48 +08:00