Commit graph

871 commits

Author SHA1 Message Date
gonglja
46d6463883
Remove unnecessary printing (#733)
* 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

* fix(codes/c): Fix space_complexity.c build error.

* feat(codes/c): Add array_binary_tree.c

* feat(code/c): Update push_back and pop_back in vector.h

* styles(codes/c): Adjust  format.

* style: Remove unnecessary print.

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-09-09 16:42:04 +08:00
krahets
f71b2a40da fix preorder_traversal_iii_compact code 2023-09-09 00:51:00 +08:00
Night Cruising
9339dbf9b3
feat: add rust docs for chapter computational complexity (#723) 2023-09-06 16:58:20 +08:00
Yudong Jin
9c3b7b6422
Sort the coding languages by applications. (#721) 2023-09-04 03:19:08 +08:00
krahets
dd72335235 Format C, C++, C#, Go, Java, Python, Rust code. 2023-09-02 23:54:38 +08:00
krahets
978857570f Format JS and TS code. 2023-09-02 23:07:47 +08:00
krahets
e052cb1d3b finetune 2023-08-31 02:32:20 +08:00
一代咩神
bc80234994
Update linked_list.md (#708)
原文:

> 单向链表:即上述介绍的普通链表。单向链表的节点包含值和指向下一节点的引用两项数据。我们将首个节点称为头节点,将最后一个节点成为尾节点,尾节点指向空 None。

应该是:将最后一个节点称为(而不是 “成为”)尾节点,尾节点指向空 None。
2023-08-30 15:26:10 +08:00
krahets
63aef4ed08 Fix a figure and latex symbols. 2023-08-30 15:25:03 +08:00
Yudong Jin
e16f898a4e
Finetune all the figures. (#704) 2023-08-30 05:20:43 +08:00
krahets
db7975d51f Fix some figures. 2023-08-30 02:52:50 +08:00
krahets
d387d9d41d finetune 2023-08-29 20:57:37 +08:00
krahets
88a746f493 finetune 2023-08-28 23:52:41 +08:00
YDJ
2f0f154b3c
Update binary_search.md (#699) 2023-08-28 23:45:51 +08:00
YDJ
beea47eb5d
Update backtracking_algorithm.md (#700) 2023-08-28 23:45:13 +08:00
Richard Zhang
3cd0352f17
fix: typo (#701) 2023-08-28 23:44:14 +08:00
krahets
8347c2da36 Update the chapter of
introduction and complexity anylysis.
2023-08-28 04:34:25 +08:00
krahets
57851ab11e Update punctuation 2023-08-27 23:40:39 +08:00
krahets
c5a7323817 Replace ":" with "。" 2023-08-27 22:49:47 +08:00
krahets
71692af8c4 Fix a figure. 2023-08-27 19:22:02 +08:00
krahets
9731a46d67 Fix a definition. 2023-08-27 00:50:18 +08:00
Liang Zhang
debf42b189
Fix a typo (#695) 2023-08-26 23:24:46 +08:00
Yudong Jin
3e64f68ae9
Add the section of iteration and recursion. (#693) 2023-08-24 17:51:41 +08:00
krahets
f524b957d4 Finetune and fix 2023-08-24 17:48:35 +08:00
krahets
1aa558bd2d Add figure and table numbers in normal texts. 2023-08-22 13:51:25 +08:00
krahets
106f02809a Mention figures and tables in normal texts.
Fix some figures.
Finetune texts.
2023-08-21 19:33:45 +08:00
krahets
1aff6d6cc2 Polish the content. 2023-08-21 03:57:09 +08:00
krahets
f5dda8d99a Polish the content 2023-08-21 03:06:53 +08:00
krahets
981144e42d 1. lower-case nouns
2. fix 2 figures
3. Replace some 「」 by “”
2023-08-20 23:28:30 +08:00
krahets
2626de8d0b Polish the chapter
introduction, computational complexity.
2023-08-20 14:51:39 +08:00
krahets
5fb728b3d6 Update H1 titles. 2023-08-20 13:37:49 +08:00
krahets
70227c82cb Remove center-table from docs.
Add header to the tables.
2023-08-19 19:22:08 +08:00
Sizhuo Long
4eb621dda7
"Add Q&A sections to array/linked_list and tree chapters" (#682)
* "Add Q&A sections to array/linked_list and tree chapters"

Added question and answers related to the use of std::list in C++ and space complexity in full binary tree traversal to their respective chapters in array_and_linked_list and tree documentation.

* Update summary.md

* Update summary.md

* Update summary.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-08-18 02:49:53 +08:00
krahets
c310edb672 Polish the chapter of array and linkedlist 2023-08-17 05:13:19 +08:00
liuyuxin
0858ab91c0
Add missing Dart codes and fix some errors (#689)
* Add missing Dart codes and fix some errors

* Update array_binary_tree.dart

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-08-17 05:04:38 +08:00
hpstory
c9006c3fe6
fix(docs): add official configuration tutorial for csharp (#687)
* fix(docs): add official configuration tutorial for csharp

* Update installation.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-08-14 23:06:11 +08:00
krahets
0c18198c01 Fix the figures.
Polish the chapter of data structure.
2023-08-13 19:32:11 +08:00
krahets
6ef4dc6444 Fix the content 2023-08-10 11:35:16 +08:00
krahets
932d14644d Polish the content
Polish the chapter preface, introduction and complexity anlysis
2023-08-08 23:16:33 +08:00
埃拉
9ed16db68e
Complement to Rust code in the Chapter array and linked list / Time Complexity. (#657)
* Complement to Rust code in the Chapter array and linked list

* Complement to Rust code in the Time Complexity

* Remove this Rust struct from 380 to 383.

* Address the comments from @night-cruise

* Add more comments in list and time complexity

* Add more comments in linked list
2023-08-07 18:22:04 +08:00
krahets
4bc6b8af7b finetune 2023-08-06 23:19:37 +08:00
krahets
08e4924054 Finetune 2023-08-04 05:25:22 +08:00
Yudong Jin
71074d88f6
Add the section of binary search insertion. (#671)
Refactor the section of binary search edge.
Finetune the figures of binary search.
2023-08-04 05:16:56 +08:00
krahets
3d81b2d954 Update the opening phrase 2023-08-04 05:13:20 +08:00
krahets
c7c33f19ac Update the opening phrase 2023-08-03 05:16:40 +08:00
Yudong Jin
43ed0e41d6
Add opening phrase for every chapters. (#670)
Update several chapter covers.
Fitune documens.
2023-08-03 04:40:29 +08:00
krahets
55615ab61d Update basic_data_types.md 2023-07-31 20:24:48 +08:00
Bubble9um
a14f04e807
Update summary.md (#669)
小结倒数第二条中 MD5常用语 更改为 常用于
2023-07-31 19:07:07 +08:00
krahets
dbe3b4d6ba Fine tune. 2023-07-31 03:27:26 +08:00
krahets
9e8aee04d5 Update number_encoding.md
Update the width of cover images.
2023-07-29 04:50:49 +08:00
krahets
c9ec4c2625 Fix greedy_algorithm.md
Add a new Q&A
2023-07-29 02:09:55 +08:00
krahets
b9b324b298 Use abbreviation for JavaScript and TypeScript 2023-07-26 15:35:38 +08:00
krahets
85d12360ed Prepare 1.0.0b4 release. 2023-07-26 11:56:32 +08:00
Yudong Jin
027bdd6510
Release Rust code to documents. (#656) 2023-07-26 11:00:53 +08:00
krahets
63a0e73df0 Unify punctuation. 2023-07-26 08:59:36 +08:00
krahets
35973068a7 Prepare for release 1.0.0b4 2023-07-26 03:15:49 +08:00
krahets
b067016bfa Update preorder_traversal_iii. 2023-07-25 16:39:38 +08:00
krahets
90af225dae Remove -> None for Python functions 2023-07-24 22:34:05 +08:00
hpstory
978d3c2ed7
fix(csharp): reformat csharp codes and docs (#652)
* fix(csharp): reformat the C# codes and docs

* Update time_complexity.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2023-07-24 19:50:00 +08:00
krahets
1777a16865 Fix Go comment and link 2023-07-24 13:11:00 +08:00
krahets
17f995b432 Finetune the chapter of hashing,
divide and conquer, backtracking, tree
2023-07-24 03:04:55 +08:00
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