xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-27 15:06:28 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions
1528 commits 5 branches 9 tags 383 MiB
Commit graph

805 commits

Author SHA1 Message Date
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
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
liuyuxin
62e8f0df50
feat: complete Dart codes for chapter_hashing (#566) 2023-06-25 20:57:37 +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
Yudong Jin
674ff2910a
Add the summary of backtracking (#561) 2023-06-22 00:22:15 +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
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
Yudong Jin
29e6617ec1
Add the section of hash algorithm. Refactor the section of hash map. (#555) 2023-06-16 21:20:57 +08:00
krahets
4dddbd1e67 Polish the section of hash map and hash collision. 2023-06-15 01:53:52 +08:00
krahets
5a2a03416f Update the section of hash collision. 2023-06-14 03:58:39 +08:00
Yudong Jin
9563965a20
Add the codes of hashmap (#553) 
of chaining and open addressing
 2023-06-14 02:01:06 +08:00
krahets
6c372542ae Add new label. 2023-06-12 23:14:16 +08:00
Yudong Jin
a111b94f23
feat: Add the section of Top-K problem (#551) 
* Add the section of Top-K problem

* Update my_heap.py

* Update build_heap.md

* Update my_heap.py
 2023-06-12 23:04:01 +08:00
Sizhuo Long
9de5d0bff2
add Q&A of stack_and_queue chapter (#547) 
* add`Q&A` of `stack_and_queue` chapter

* Update summary.md

* Update summary.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-06-11 20:06:26 +08:00
Curly Brackets
f7a2670756
Fix inline code with number_encoding.md (#550) 2023-06-11 19:22:34 +08:00
krahets
698c2e7fe5 Fix some codes and a figure. 2023-06-05 01:03:39 +08:00
krahets
d528b1ae07 Update index.md 2023-06-02 20:30:29 +08:00
liuyuxin
281c0c618a
feat: modify some Dart codes and add Dart code blocks to the docs (#543) 2023-06-02 14:56:29 +08:00
Yudong Jin
025051c81b
Add Dart codes to the documents. (#529) 2023-06-02 02:40:26 +08:00
Yudong Jin
041a989d33
Add the chapter cover images (#528) 2023-06-02 01:36:51 +08:00
krahets
033dca77fe Update the summary of array and linkedlist 2023-06-02 01:29:48 +08:00
krahets
268c73b3c3 Update and fix some contents. 
Place the comment box above the comments.
 2023-06-01 18:46:07 +08:00
krahets
de10d2e471 Fix selection_sort.md 2023-06-01 00:34:41 +08:00
krahets
e35e2e31eb Add the figure of assembling blocks. 
Update some texts.
 2023-05-31 01:04:40 +08:00
krahets
5cf10d6924 Update a gif preview. 2023-05-28 17:25:18 +08:00
krahets
9872e7f94f Update the gif previews. 2023-05-28 16:55:41 +08:00
krahets
6f76203dd9 Fix some mistakes. 2023-05-27 17:13:51 +08:00
Sizhuo Long
1028c0c083
add Q&A about array_and_linklist and fix miss one "$" in c_c chapter (#515) 
* fix "$" in c_c summary and add QA of array_linklist in summary

* Update summary.md

* Update summary.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-05-26 21:27:34 +08:00
krahets
fb72aa385e Polish some texts. 2023-05-26 20:34:48 +08:00
Yudong Jin
ee716a2c23
feat: Add the section of heap sort. (#516) 
* Add the section of heap sort.

* Update heap_sort.cpp
 2023-05-26 04:46:56 +08:00
krahets
afb08a26e0 Fix a typo. 2023-05-26 04:31:14 +08:00
krahets
11c835d79c Update the section of heap. 2023-05-25 20:25:19 +08:00
krahets
b9178bc7d6 Polish some texts. 2023-05-24 20:57:08 +08:00
Sizhuo Long
16365ae5f0
Add Q&A of computational_complexity and graph chapter (#512) 
* add Q&A in the summary.md of computational complexity chapter

* add Q&A in the summary.md of graph

* Update summary.md

* Update summary.md

* Update summary.md

* Update summary.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-05-24 20:46:12 +08:00
krahets
dc49fdf75e Polish some contents. 2023-05-24 11:45:52 +08:00
krahets
38c56b581a Fix the figures of selection sort. 2023-05-24 00:44:55 +08:00
Yudong Jin
77b4f4c400
Add the section of selection sort. (#513) 2023-05-24 00:35:46 +08:00
krahets
5dff1bd0e8 Update the insertion sort. 2023-05-24 00:33:27 +08:00
krahets
588980af86 Update the sorting algorithms. 2023-05-24 00:05:12 +08:00
krahets
a2d2011c78 Update some figures in bubble sort 
and insertion sort
 2023-05-23 23:21:56 +08:00
krahets
eb8df49993 Update bubble sort and insertion sort. 2023-05-23 21:20:14 +08:00
krahets
5b406666d8 Polish the content 2023-05-22 22:04:31 +08:00
krahets
e196962d0a Simplify the declarations of the Python code. 2023-05-22 22:03:57 +08:00
krahets
081b76d620 Polish the sections of binary search. 2023-05-22 01:37:12 +08:00
krahets
24d90931e3 Update the callouts for the algorithm problems. 2023-05-21 19:58:21 +08:00
krahets
d3cc149c5a Merge the chapter of binary tree and searching. 2023-05-21 19:26:52 +08:00
Yudong Jin
b5eb9ca271
feat: Add the section of binary search edge. (#508) 
* Add the section of binary search edge.

* Delete binary_search_rotation.py
 2023-05-21 19:04:21 +08:00
krahets
c3e7455285 Refactor the section of bianry search. 2023-05-21 04:51:32 +08:00
krahets
399e5df39a Polish some cotents. 2023-05-18 20:27:58 +08:00
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>
 2023-05-18 19:02:32 +08:00