eba015c0bb
add Rust codes for hash_map ( #751 )
2023-09-15 02:09:16 +08:00
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
9c3b7b6422
Sort the coding languages by applications. ( #721 )
2023-09-04 03:19:08 +08:00
978857570f
Format JS and TS code.
2023-09-02 23:07:47 +08:00
e052cb1d3b
finetune
2023-08-31 02:32:20 +08:00
e16f898a4e
Finetune all the figures. ( #704 )
2023-08-30 05:20:43 +08:00
d387d9d41d
finetune
2023-08-29 20:57:37 +08:00
57851ab11e
Update punctuation
2023-08-27 23:40:39 +08:00
c5a7323817
Replace "：" with "。"
2023-08-27 22:49:47 +08:00
1aa558bd2d
Add figure and table numbers in normal texts.
2023-08-22 13:51:25 +08:00
106f02809a
Mention figures and tables in normal texts.
...
Fix some figures.
Finetune texts.
2023-08-21 19:33:45 +08:00
1aff6d6cc2
Polish the content.
2023-08-21 03:57:09 +08:00
981144e42d
1. lower-case nouns
...
2. fix 2 figures
3. Replace some 「」 by “”
2023-08-20 23:28:30 +08:00
70227c82cb
Remove center-table from docs.
...
Add header to the tables.
2023-08-19 19:22:08 +08:00
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
932d14644d
Polish the content
...
Polish the chapter preface, introduction and complexity anlysis
2023-08-08 23:16:33 +08:00
c7c33f19ac
Update the opening phrase
2023-08-03 05:16:40 +08:00
43ed0e41d6
Add opening phrase for every chapters. ( #670 )
...
Update several chapter covers.
Fitune documens.
2023-08-03 04:40:29 +08:00
a14f04e807
Update summary.md ( #669 )
...
小结倒数第二条中 MD5常用语 更改为 常用于
2023-07-31 19:07:07 +08:00
9e8aee04d5
Update number_encoding.md
...
Update the width of cover images.
2023-07-29 04:50:49 +08:00
b9b324b298
Use abbreviation for JavaScript and TypeScript
2023-07-26 15:35:38 +08:00
027bdd6510
Release Rust code to documents. ( #656 )
2023-07-26 11:00:53 +08:00
63a0e73df0
Unify punctuation.
2023-07-26 08:59:36 +08:00
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
17f995b432
Finetune the chapter of hashing,
...
divide and conquer, backtracking, tree
2023-07-24 03:04:55 +08:00
b676349dac
Update hash_map.md ( #641 )
2023-07-21 22:15:46 +08:00
470bc10a74
Fix some contents.
2023-07-06 00:04:11 +08:00
200275b39a
Update index.md
...
Add the code to hash_algorithm.md
2023-07-03 16:56:42 +08:00
1113d03a8f
Add new Q&As.
2023-07-01 22:37:26 +08:00
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
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
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
3902ccbfc7
Fine-tune the docs.
2023-06-25 21:11:24 +08:00
62e8f0df50
feat: complete Dart codes for chapter_hashing ( #566 )
2023-06-25 20:57:37 +08:00
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
1b1af8d038
Add Java and C++ code for the section hash algorithm ( #560 )
2023-06-21 19:26:16 +08:00
73372ad35a
Update the summary of hashing chapter.
2023-06-16 21:50:23 +08:00
29e6617ec1
Add the section of hash algorithm. Refactor the section of hash map. ( #555 )
2023-06-16 21:20:57 +08:00
4dddbd1e67
Polish the section of hash map and hash collision.
2023-06-15 01:53:52 +08:00
5a2a03416f
Update the section of hash collision.
2023-06-14 03:58:39 +08:00
9563965a20
Add the codes of hashmap ( #553 )
...
of chaining and open addressing
2023-06-14 02:01:06 +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
025051c81b
Add Dart codes to the documents. ( #529 )
2023-06-02 02:40:26 +08:00
041a989d33
Add the chapter cover images ( #528 )
2023-06-02 01:36:51 +08:00
268c73b3c3
Update and fix some contents.
...
Place the comment box above the comments.
2023-06-01 18:46:07 +08:00
399e5df39a
Polish some cotents.
2023-05-18 20:27:58 +08:00
951599e192
Update hash_collision.md ( #504 )
...
* Update hash_collision.md
a detailed description of the conditions for converting a linked list into a red-black tree is as follows.
```java
final void treeifyBin(Node<K,V>[] tab, int hash) {
int n, index; Node<K,V> e;
if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
}
```
* Update hash_collision.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-05-18 19:02:32 +08:00
dbc4906582
Publish the C codes to the docs. ( #469 )
2023-04-18 20:21:31 +08:00
881d573790
Refactor the articles related to searching algorithm. Add the chapter of binary search. Add the section of searching algorithm revisited. ( #464 )
2023-04-17 18:22:18 +08:00
9a74d9a9d1
Polish the chapter of searching and sorting.
2023-04-10 03:11:49 +08:00
