|
|
ae304bd605
|
Update iteration code.
|
2023-08-25 02:22:57 +08:00 |
|
|
|
3e64f68ae9
|
Add the section of iteration and recursion. (#693)
|
2023-08-24 17:51:41 +08:00 |
|
|
|
f5dda8d99a
|
Polish the content
|
2023-08-21 03:06:53 +08:00 |
|
|
|
2626de8d0b
|
Polish the chapter
introduction, computational complexity.
|
2023-08-20 14:51:39 +08:00 |
|
|
|
c310edb672
|
Polish the chapter of array and linkedlist
|
2023-08-17 05:13:19 +08:00 |
|
|
|
6ef4dc6444
|
Fix the content
|
2023-08-10 11:35:16 +08:00 |
|
|
|
932d14644d
|
Polish the content
Polish the chapter preface, introduction and complexity anlysis
|
2023-08-08 23:16:33 +08:00 |
|
|
|
4bc6b8af7b
|
finetune
|
2023-08-06 23:19:37 +08:00 |
|
|
|
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 |
|
|
|
fc63e990c8
|
fix: Object pointer not deleted (#662)
* fix: Object pointer not deleted
* codes/cpp/chapter_hashing
Signed-off-by: yishangzhang <zhangyi2017@cug.edu.cn>
* Update hash_map_chaining.cpp
---------
Signed-off-by: yishangzhang <zhangyi2017@cug.edu.cn>
Co-authored-by: Yudong Jin <krahets@163.com>
|
2023-07-29 02:08:00 +08:00 |
|
|
|
b067016bfa
|
Update preorder_traversal_iii.
|
2023-07-25 16:39:38 +08:00 |
|
|
|
bba62bbe75
|
Fix the code of preorder_traversal_iii_compact
|
2023-07-21 22:08:26 +08:00 |
|
|
|
075c3abf88
|
Add the section of max product cutting problem. (#642)
|
2023-07-21 21:56:14 +08:00 |
|
|
|
76f11ae168
|
Add the section of max capacity problem. (#639)
|
2023-07-21 15:16:51 +08:00 |
|
|
|
2b7d7aa827
|
Add the chapter of greedy. (#633)
Add the section of fractional knapsack.
|
2023-07-20 18:26:54 +08:00 |
|
|
|
c54536d1a1
|
Modify the problem of preorder_traversal_iii
|
2023-07-19 16:37:12 +08:00 |
|
|
|
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 |
|
|
|
1f784dadb0
|
Add Java and C++ code for the chapter of
divide and conquer.
|
2023-07-17 04:20:12 +08:00 |
|
|
|
c3f80e52af
|
Add the section of edit distance problem (#599)
|
2023-07-13 05:27:47 +08:00 |
|
|
|
1c02859b13
|
Add the section of unbounded knapsack problem.
|
2023-07-11 19:22:41 +08:00 |
|
|
|
ad0fd45cfb
|
Add Java and C++ code for the chapter of DP.
|
2023-07-11 01:08:26 +08:00 |
|
|
|
cddddb8b8b
|
Update knapsack_problem and intro_to_dp
Fix avl_tree
|
2023-07-09 02:39:58 +08:00 |
|
|
|
920512d872
|
Update the section of intro to DP.
|
2023-07-01 03:02:50 +08:00 |
|
|
|
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 |
|
|
|
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 |
|
|
|
1b1af8d038
|
Add Java and C++ code for the section hash algorithm (#560)
|
2023-06-21 19:26:16 +08:00 |
|
|
|
0e2ddba30f
|
Add the section of subset sum problem. (#558)
|
2023-06-21 02:58:24 +08:00 |
|
|
|
9fc1a0b2b3
|
Update n_queens code.
|
2023-06-21 02:56:28 +08:00 |
|
|
|
29e6617ec1
|
Add the section of hash algorithm. Refactor the section of hash map. (#555)
|
2023-06-16 21:20:57 +08:00 |
|
|
|
9563965a20
|
Add the codes of hashmap (#553)
of chaining and open addressing
|
2023-06-14 02:01:06 +08:00 |
|
|
|
d3e597af94
|
Update cmakelists.txt
|
2023-06-13 21:16:54 +08:00 |
|
|
|
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 |
|
|
|
6377e3316a
|
Fix a comment in my_list.xx
|
2023-06-03 22:18:28 +08:00 |
|
|
|
b39e79be85
|
Fix remove() in binary search tree.
|
2023-05-26 20:34:22 +08:00 |
|
|
|
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 |
|
|
|
dc49fdf75e
|
Polish some contents.
|
2023-05-24 11:45:52 +08:00 |
|
|
|
77b4f4c400
|
Add the section of selection sort. (#513)
|
2023-05-24 00:35:46 +08:00 |
|
|
|
5dff1bd0e8
|
Update the insertion sort.
|
2023-05-24 00:33:27 +08:00 |
|
|
|
eb8df49993
|
Update bubble sort and insertion sort.
|
2023-05-23 21:20:14 +08:00 |
|
|
|
f6d290d903
|
Update the comments of bubble sort
and insertion sort
|
2023-05-22 23:05:37 +08:00 |
|
|
|
d95c628eef
|
Fix the test case of binary search.
|
2023-05-21 19:29:24 +08:00 |
|
|
|
d3cc149c5a
|
Merge the chapter of binary tree and searching.
|
2023-05-21 19:26:52 +08:00 |
|
|
|
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 |
|
|
|
c3e7455285
|
Refactor the section of bianry search.
|
2023-05-21 04:51:32 +08:00 |
|
|
|
399e5df39a
|
Polish some cotents.
|
2023-05-18 20:27:58 +08:00 |
|
|
|
817b4598d5
|
Fix a comment in binary_search_tree code
|
2023-05-17 19:04:46 +08:00 |
|
|
|
fe69f7240d
|
Add figures to replace_linear_by_hashing.md
|
2023-05-09 00:36:18 +08:00 |
|
|
|
67d647ab59
|
feat: Add the section of n queens problem (#483)
* Add the section of n queens problem
* Update n_queens.py
* Update n_queens.java
* Update n_queens.cpp
* Update n_queens.java
|
2023-05-04 05:27:17 +08:00 |
|
|
|
bc77a81330
|
Update the codes of backtracking.
|
2023-04-27 02:17:04 +08:00 |
|
|
|
3f430fb85e
|
Update the code of permutations i and ii
|
2023-04-27 01:18:18 +08:00 |
|
