krahets
db5d1d21f3
Several bug fixes.
2023-10-29 00:09:54 +08:00
Justin Tse
c37f0981f0
feat: refactor top_k.ts ( #899 )
2023-10-28 14:27:52 +08:00
lucas
f98b337144
refactor: Re-implement hanota.c ( #885 )
...
* feat: re-impl hanota.c
* chore: Remove useless comment code
* Update hanota.c
* Update hanota.c
* Update print_util.h
* Update CMakeLists.txt
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-10-27 23:41:58 +08:00
Yudong Jin
492a69ebca
refactor: Replace vector with array in C code ( #894 )
...
* Re-implement merge sort function.
* Replace vector with array for C.
* fix
2023-10-27 23:26:48 +08:00
krahets
5385057993
Replace "结点" with "节点".
2023-10-27 23:24:13 +08:00
nuomi1
7605cab160
feature(swift): Reimplement merge_sort and top_k ( #898 )
...
* feat: Add swift-collections
* fix: use heap
* refactor: merge
* fix: import HeapModule
2023-10-27 22:59:54 +08:00
liuyuxin
1ab83bd3ef
refactor(dart): Re-implement merge sort function ( #896 )
2023-10-27 16:00:26 +08:00
krahets
bd8cda325e
A few improvements to the C code.
2023-10-27 01:13:36 +08:00
krahets
0e10274bb4
Update arrayToTree() and treeToArray() for C.
2023-10-27 01:04:17 +08:00
krahets
5b1a219b8b
Fine-tune code and texts.
2023-10-27 01:01:21 +08:00
易春风
3628b40f44
refactor: re-implement the rust codes of merge sort ( #891 )
2023-10-26 22:24:02 +08:00
Yudong Jin
e441ee4e35
Re-implement merge sort function. ( #888 )
2023-10-26 02:56:33 +08:00
Yudong Jin
7822bf9cd4
feat: add top_k.c and refactor top_k.js ( #889 )
...
* Add top_k.c based on my_heap.c
* Improve the implementation of top_k.js
* Add a comment to top_k
2023-10-26 02:54:19 +08:00
liuyuxin
a8b2350705
feat(dart): Add build check for Dart ( #886 )
...
* feat(dart): Add build check for Dart
* feat(dart): Add dart analyze to check
* fix(dart): remove dart analyze
* feat(dart): Ignore unused variable and add dart analyze
2023-10-25 23:15:53 +08:00
Yudong Jin
d26e811e10
Several bug fixes and improvements. ( #887 )
...
* fix the bugs of C code.
* Add a header figure.
* Improve the definition of tree node height.
2023-10-25 22:59:25 +08:00
52coder
436b6fa9a6
Add C++ iterator example for C++ ( #837 )
...
* 增加c++迭代器访问示例
* Update hash_map.md
* Update hash_map.cpp
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-10-24 23:59:10 +08:00
Spark
2035aa0cf1
feat: iteration & recursion in Zig ( #804 )
...
* iteration & recursion in Zig
* missing part in time_complexity.md (zig)
* build.zig sync
* Update recursion.zig
* Update iteration.zig
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-10-24 23:49:13 +08:00
Yudong Jin
19023148ba
feat: Update the implementation of hash_map_open_addressing.js and .ts ( #881 )
...
* add permutations_ii.c and re-implement permutations_i.c
* Update the implementation of hash_map_open_addressing.js and .ts
* Update hash_map_open_addressing.js
* Update hash_map_open_addressing.js
2023-10-24 23:46:34 +08:00
hpstory
fb3ce050c1
feat(csharp): add .net building and testing workflow, solution file ( #879 )
2023-10-24 17:13:29 +08:00
krahets
17252b53a9
Format code and docs.
2023-10-24 16:19:29 +08:00
Reese Wellin
88a1e4aaac
refactor(JS, TS): Improve code readability in edit_distance ( #860 )
...
* fix(JS、TS): chapter_sorting QuickSortMedian and QuickSortTailCall example
* refactor(JS、TS): Improve code readability in edit_distance
* Updated code
2023-10-24 15:32:20 +08:00
krahets
d27890d98d
Fix automating build workflow for Python
2023-10-23 16:06:33 +08:00
krahets
b7c110e5ec
Add build check with py_compile
2023-10-23 06:02:34 +08:00
sjinzh
0c470d19c8
upate build.zig ( #874 )
2023-10-23 03:20:16 +08:00
krahets
5aacf2dfe0
Improve Python code for importing modules.
2023-10-19 16:21:51 +08:00
krahets
1e49574332
Simplify struct declarations of C.
...
Use PascalCase for all structs in C.
SImplify n_queens.c
Format C code for chapter of graph.
2023-10-18 02:16:26 +08:00
krahets
5392afd44b
fix several bugs
2023-10-17 23:45:31 +08:00
Yudong Jin
51405c0669
add permutations_ii.c and re-implement permutations_i.c ( #868 )
2023-10-17 10:20:10 -05:00
lucas
37872726b0
feat: build_tree.c translation ( #847 )
...
* feat: build_tree.c translation
* Update CMakeLists.txt
* chore: find with map
* change inordermap
* Update build_tree.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-10-17 08:47:16 -05:00
Yudong Jin
ea7275ab6a
add forLoopRecur in recursion.c ( #866 )
2023-10-17 07:28:17 -05:00
krahets
346c8451de
Fix code naming style.
2023-10-15 21:18:09 +08:00
krahets
ada37fd1f8
Fix Python code.
2023-10-14 22:15:02 +08:00
krahets
2976d9ff56
Fix Python code.
2023-10-14 21:54:47 +08:00
krahets
a8c624fa5a
Fix the code in min_path_sum
2023-10-14 03:25:11 +08:00
Yudong Jin
3df5c36370
refactor: Improve the hash_map_chaining.c implementation. ( #858 )
...
* Improve the hash_map_chaining.c implementation.
* Update hash_map_chaining.c
2023-10-13 02:04:45 -05:00
krahets
84e2799f1b
Fix hash_map_chaining.c and
...
hash_map_open_addressing.c
2023-10-13 14:32:49 +08:00
lclc6
fe01f77ff8
Create hash_map_open_addressing.c ( #838 )
...
* Create hash_map_open_addressing.c
哈希冲突-C语言
* Update hash_map_open_addressing.c
* Update hash_map_open_addressing.c
* Update hash_map_open_addressing.c
2023-10-13 01:15:23 -05:00
FreddieLi
61eca92055
fix get() in hash_map_chaining.c ( #845 )
...
Fix get function.
2023-10-13 01:09:06 -05:00
krahets
da5ef293d9
fix a typo
2023-10-11 17:39:56 +08:00
krahets
c37b7c807b
Several bug fixes
2023-10-09 18:21:18 +08:00
krahets
fb552987f5
Update variable names in list and my_list
2023-10-09 18:20:42 +08:00
lucas
704b638d89
feat: n_queens.c translation ( #774 )
...
* feat: tranlating n_queens.c
* Reference to c++ code with additional comments
* Update n_queens.c
* Update n_queens.c
* Format n_queens.c
* Update n_queens.c
keep the file header information format consistent with others
* fine tune
* fine tune
* Delete mkdocs-en.yml
* Update README.md
---------
Co-authored-by: krahets <krahets@163.com>
2023-10-08 12:42:32 -05:00
hpstory
e03022d5fb
fix: Polishing code format on linearLogRecur, convert String type to string ( #841 )
2023-10-08 07:33:30 -05:00
王作勋
2bba70fd87
Add Edit distance in C code ( #835 )
...
* Update vector.h
增加功能列表:
获取向量的第 i 个元素
设置向量的第 i 个元素
向量扩容
向量缩容
向量插入元素
向量删除元素
向量交换元素
向量是否为空
向量是否已满
向量是否相等
对向量内部进行排序(升序/降序)
对向量某段数据排序(升序/降序)
* Create hanota.c
* 新增binary_search_recur.c
* Update vector.h
* Delete codes/c/chapter_divide_and_conquer directory
* Update vector.h
* Create binary_search_recur.c
* Delete codes/chapter_divide_and_conquer directory
* Update vector.h
* old vector.h
* Create edit_distance.c
* Update edit_distance.c
* Update edit_distance.c
* Update edit_distance.c
* Create CMakeLists.txt
* Update edit_distance.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-10-07 22:29:44 -05:00
王作勋
1a3b819355
Add Climbing stairs constraint dp in C code ( #829 )
...
* Update vector.h
增加功能列表:
获取向量的第 i 个元素
设置向量的第 i 个元素
向量扩容
向量缩容
向量插入元素
向量删除元素
向量交换元素
向量是否为空
向量是否已满
向量是否相等
对向量内部进行排序(升序/降序)
对向量某段数据排序(升序/降序)
* Create hanota.c
* 新增binary_search_recur.c
* Update vector.h
* Delete codes/c/chapter_divide_and_conquer directory
* Update vector.h
* Create binary_search_recur.c
* Delete codes/chapter_divide_and_conquer directory
* Update vector.h
* Create climbing_stairs_constraint_dp.c
* RollBack vector.h
* Create CMakeLists.txt
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-10-07 22:28:23 -05:00
krahets
51dab9dd25
Update overrides directory structure.
2023-10-08 04:42:57 +08:00
hpstory
f62256bee1
fix(csharp): Modify method name to PascalCase, simplify new expression ( #840 )
...
* Modify method name to PascalCase(array and linked list)
* Modify method name to PascalCase(backtracking)
* Modify method name to PascalCase(computational complexity)
* Modify method name to PascalCase(divide and conquer)
* Modify method name to PascalCase(dynamic programming)
* Modify method name to PascalCase(graph)
* Modify method name to PascalCase(greedy)
* Modify method name to PascalCase(hashing)
* Modify method name to PascalCase(heap)
* Modify method name to PascalCase(searching)
* Modify method name to PascalCase(sorting)
* Modify method name to PascalCase(stack and queue)
* Modify method name to PascalCase(tree)
* local check
2023-10-07 12:33:46 -05:00
47
70cff2d99f
fix: Fixed the state transition error in minCostClimbingStairsDP function ( #839 )
...
Signed-off-by: foursevenlove <foursevenlove@gmail.com>
2023-10-07 08:52:12 -05:00
Nepenthe
61e1d1faec
feat(go): add forLoopRecur func ( #816 )
2023-10-07 08:47:58 -05:00
王作勋
ef87bd494a
Add Binary search recur in C code ( #820 )
...
* Update vector.h
增加功能列表:
获取向量的第 i 个元素
设置向量的第 i 个元素
向量扩容
向量缩容
向量插入元素
向量删除元素
向量交换元素
向量是否为空
向量是否已满
向量是否相等
对向量内部进行排序(升序/降序)
对向量某段数据排序(升序/降序)
* Create hanota.c
* 新增binary_search_recur.c
* Update vector.h
* Delete codes/c/chapter_divide_and_conquer directory
* Update vector.h
* Create binary_search_recur.c
* Create CMakeLists.txt
* Update vector.h
* RollBack vector.h
* Update CMakeLists.txt
* Update binary_search_recur.c
* Update binary_search_recur.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-10-07 08:47:05 -05:00