Commit graph

760 commits

Author SHA1 Message Date
krahets
abec926c24 Finetune the documents.
Update mindmap.
Add the cover image of chapter appendix.
2023-07-22 04:29:08 +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
William Yuan
b676349dac
Update hash_map.md (#641) 2023-07-21 22:15:46 +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
wangwang105
30d1d36dd7
Update space_complexity.md (#631)
* Update space_complexity.md

修改一个C语言的函数,c语言中错误使用C++的STL库的vector类,现在更正为直接使用定义数组去申请内存

* Update space_complexity.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-07-20 18:56:35 +08:00
Yudong Jin
2b7d7aa827
Add the chapter of greedy. (#633)
Add the section of fractional knapsack.
2023-07-20 18:26:54 +08:00
krahets
c54536d1a1 Modify the problem of preorder_traversal_iii 2023-07-19 16:37:12 +08:00
krahets
4e13755023 Add implementation of array binary tree.
Rewrite the tree serialization and deserialization methods.
Add applications of array and linked list.
2023-07-19 16:09:27 +08:00
krahets
c68f18e480 Finetune 2023-07-19 01:45:14 +08:00
hpstory
7a6fd4b3dd
feat(csharp): add csharp code for charper divide and conquer (#628) 2023-07-19 01:19:49 +08:00
krahets
34985bdf2b Add the summary of chapter divide and conquer
Enable instant loading feature
Fix the math rendering in mathjax.js
2023-07-17 20:23:46 +08:00
krahets
06b309d021 1. Add section links to the chapter page.
2. Add chapter icons to navigation panel.
3. Replace recently added text with icon.
2023-07-17 17:54:48 +08:00
krahets
2caf3464ad Add the chapter cover image for divide and conquer 2023-07-17 04:53:54 +08:00
krahets
1f784dadb0 Add Java and C++ code for the chapter of
divide and conquer.
2023-07-17 04:20:12 +08:00
krahets
fc7bcb615d Add the section of binary_search_recur. 2023-07-17 03:48:33 +08:00
Yudong Jin
909daea105
Add the section of hanota problem. (#614) 2023-07-17 02:20:49 +08:00
krahets
f839dc1b0e Fix naming of the section
build_binary_tree_problem
2023-07-17 02:18:53 +08:00
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
krahets
b2b2fa335c Update the summary of the chapter DP. 2023-07-14 03:08:08 +08:00
krahets
bbf8aa2019 Add the summary of chapter DP.
Finetune the articles of DP.
2023-07-14 02:54:47 +08:00
Yudong Jin
c3f80e52af
Add the section of edit distance problem (#599) 2023-07-13 05:27:47 +08:00
krahets
73190703ea Add playing cards sorting example to
algos_are_everywhere
2023-07-12 03:52:33 +08:00
krahets
05cde001df Finetune the articles. 2023-07-11 19:23:46 +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
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
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
krahets
200275b39a Update index.md
Add the code to hash_algorithm.md
2023-07-03 16:56:42 +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
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