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

182 commits

Author SHA1 Message Date
krahets
628d8a516b fix binary_search_tree code 2023-08-31 02:31:31 +08:00
gaofer
f7ab4797bf
feat: add dynamic programming code for JS and TS (#692) 
* fix: Correcting typos

* Add JavaScript and TypeScript code of dynamic programming.

* fix: Code Style

* Change ==/!= to ===/!==
* Create const by default, change to let if necessary.

* style fix: Delete unnecessary defined type
 2023-08-30 15:27:01 +08:00
krahets
9731a46d67 Fix a definition. 2023-08-27 00:50:18 +08:00
krahets
ae304bd605 Update iteration code. 2023-08-25 02:22:57 +08:00
Yudong Jin
3e64f68ae9
Add the section of iteration and recursion. (#693) 2023-08-24 17:51:41 +08:00
krahets
f5dda8d99a Polish the content 2023-08-21 03:06:53 +08:00
krahets
2626de8d0b Polish the chapter 
introduction, computational complexity.
 2023-08-20 14:51:39 +08:00
krahets
c310edb672 Polish the chapter of array and linkedlist 2023-08-17 05:13:19 +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
hpstory
c14ca74b8b
feat(csharp): add binary search csharp codes (#676) 2023-08-06 23:16:02 +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
6da6d24193 Fix the code of hash map chaining. 2023-08-01 17:05:40 +08:00
krahets
b067016bfa Update preorder_traversal_iii. 2023-07-25 16:39:38 +08:00
Night Cruising
41db3701ab
Update max_product_cutting.java (#647) 2023-07-24 03:05:57 +08:00
krahets
bba62bbe75 Fix the code of preorder_traversal_iii_compact 2023-07-21 22:08:26 +08:00
Yudong Jin
075c3abf88
Add the section of max product cutting problem. (#642) 2023-07-21 21:56:14 +08:00
Yudong Jin
76f11ae168
Add the section of max capacity problem. (#639) 2023-07-21 15:16:51 +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
ZongYangL
03cbf5b972
Anonymous inner classes create generic instances that display the dec… (#627) 
* Anonymous inner classes create generic instances that display the declared type

* Update TreeNode.java

* Update binary_tree_bfs.java

* Update graph_bfs.java

---------

Co-authored-by: zongjianwei <zongjianwei@meituan.com>
Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-19 01:37:55 +08:00
krahets
1f784dadb0 Add Java and C++ code for the chapter of 
divide and conquer.
 2023-07-17 04:20:12 +08:00
Yudong Jin
c3f80e52af
Add the section of edit distance problem (#599) 2023-07-13 05:27:47 +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
cddddb8b8b Update knapsack_problem and intro_to_dp 
Fix avl_tree
 2023-07-09 02:39:58 +08:00
krahets
920512d872 Update the section of intro to DP. 2023-07-01 03:02:50 +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
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
liuyuxin
62e8f0df50
feat: complete Dart codes for chapter_hashing (#566) 2023-06-25 20:57:37 +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
9fc1a0b2b3 Update n_queens code. 2023-06-21 02:56:28 +08:00
Yudong Jin
9563965a20
Add the codes of hashmap (#553) 
of chaining and open addressing
 2023-06-14 02:01:06 +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
krahets
6377e3316a Fix a comment in my_list.xx 2023-06-03 22:18:28 +08:00
krahets
b39e79be85 Fix remove() in binary search tree. 2023-05-26 20:34:22 +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
11c835d79c Update the section of heap. 2023-05-25 20:25:19 +08:00
krahets
dc49fdf75e Polish some contents. 2023-05-24 11:45:52 +08:00
Yudong Jin
77b4f4c400
Add the section of selection sort. (#513) 2023-05-24 00:35:46 +08:00
krahets
eb8df49993 Update bubble sort and insertion sort. 2023-05-23 21:20:14 +08:00
krahets
f6d290d903 Update the comments of bubble sort 
and insertion sort
 2023-05-22 23:05:37 +08:00
krahets
d95c628eef Fix the test case of binary search. 2023-05-21 19:29:24 +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