Yudong Jin
a46b482951
Refactor the hash_map_open_addressing implementation with lazy reallocation. ( #776 )
1 year ago
Kato0130
eba015c0bb
add Rust codes for hash_map ( #751 )
1 year ago
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>
1 year ago
Yudong Jin
9c3b7b6422
Sort the coding languages by applications. ( #721 )
1 year ago
krahets
978857570f
Format JS and TS code.
1 year ago
krahets
e052cb1d3b
finetune
1 year ago
Yudong Jin
e16f898a4e
Finetune all the figures. ( #704 )
1 year ago
krahets
d387d9d41d
finetune
1 year ago
krahets
57851ab11e
Update punctuation
1 year ago
krahets
c5a7323817
Replace ":" with "。"
1 year ago
krahets
1aa558bd2d
Add figure and table numbers in normal texts.
1 year ago
krahets
106f02809a
Mention figures and tables in normal texts.
...
Fix some figures.
Finetune texts.
1 year ago
krahets
1aff6d6cc2
Polish the content.
1 year ago
krahets
981144e42d
1. lower-case nouns
...
2. fix 2 figures
3. Replace some 「」 by “”
1 year ago
krahets
70227c82cb
Remove center-table from docs.
...
Add header to the tables.
1 year ago
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>
1 year ago
krahets
932d14644d
Polish the content
...
Polish the chapter preface, introduction and complexity anlysis
1 year ago
krahets
c7c33f19ac
Update the opening phrase
1 year ago
Yudong Jin
43ed0e41d6
Add opening phrase for every chapters. ( #670 )
...
Update several chapter covers.
Fitune documens.
1 year ago
Bubble9um
a14f04e807
Update summary.md ( #669 )
...
小结倒数第二条中 MD5常用语 更改为 常用于
1 year ago
krahets
9e8aee04d5
Update number_encoding.md
...
Update the width of cover images.
1 year ago
krahets
b9b324b298
Use abbreviation for JavaScript and TypeScript
1 year ago
Yudong Jin
027bdd6510
Release Rust code to documents. ( #656 )
1 year ago
krahets
63a0e73df0
Unify punctuation.
1 year ago
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>
1 year ago
krahets
17f995b432
Finetune the chapter of hashing,
...
divide and conquer, backtracking, tree
1 year ago
William Yuan
b676349dac
Update hash_map.md ( #641 )
1 year ago
krahets
470bc10a74
Fix some contents.
1 year ago
krahets
200275b39a
Update index.md
...
Add the code to hash_algorithm.md
1 year ago
krahets
1113d03a8f
Add new Q&As.
1 year ago
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>
1 year ago
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
1 year ago
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.
1 year ago
krahets
3902ccbfc7
Fine-tune the docs.
1 year ago
liuyuxin
62e8f0df50
feat: complete Dart codes for chapter_hashing ( #566 )
1 year ago
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>
1 year ago
Yudong Jin
1b1af8d038
Add Java and C++ code for the section hash algorithm ( #560 )
1 year ago
krahets
73372ad35a
Update the summary of hashing chapter.
1 year ago
Yudong Jin
29e6617ec1
Add the section of hash algorithm. Refactor the section of hash map. ( #555 )
1 year ago
krahets
4dddbd1e67
Polish the section of hash map and hash collision.
1 year ago
krahets
5a2a03416f
Update the section of hash collision.
1 year ago
Yudong Jin
9563965a20
Add the codes of hashmap ( #553 )
...
of chaining and open addressing
1 year ago
liuyuxin
281c0c618a
feat: modify some Dart codes and add Dart code blocks to the docs ( #543 )
1 year ago
Yudong Jin
025051c81b
Add Dart codes to the documents. ( #529 )
1 year ago
Yudong Jin
041a989d33
Add the chapter cover images ( #528 )
1 year ago
krahets
268c73b3c3
Update and fix some contents.
...
Place the comment box above the comments.
1 year ago
krahets
399e5df39a
Polish some cotents.
2 years ago
Suremotoo
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>
2 years ago
Yudong Jin
dbc4906582
Publish the C codes to the docs. ( #469 )
2 years ago
Yudong Jin
881d573790
Refactor the articles related to searching algorithm. Add the chapter of binary search. Add the section of searching algorithm revisited. ( #464 )
2 years ago