61eca92055
fix get() in hash_map_chaining.c ( #845 )
...
Fix get function.
1 year ago
da5ef293d9
fix a typo
1 year ago
227bd66223
Update Dockerfile and mkdocs.yml
...
Fix a variable name in list.md
1 year ago
c37b7c807b
Several bug fixes
1 year ago
fb552987f5
Update variable names in list and my_list
1 year ago
e5f8c93f5d
fix a Python variable name in list.md
...
Python 代码中的列表命名为list时，会出现如下错误。
list:list[int] = [1, 2, 3, 4, 5]
TypeError: list indices must be integers or slices, not type
建议修改为list2
1 year ago
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>
1 year ago
c098bcdde4
Several bug fixes.
1 year ago
b85deae275
Update time_complexity.md ( #844 )
...
错别字
1 year ago
e03022d5fb
fix: Polishing code format on linearLogRecur, convert String type to string ( #841 )
1 year ago
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>
1 year ago
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>
1 year ago
51dab9dd25
Update overrides directory structure.
1 year ago
7e15726bb5
Update .gitignore
1 year ago
b39c2a94d3
Move docs/zh back to docs.
...
Move docs/overrides to overrides/.
Other fine tunes.
1 year ago
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
1 year ago
6f7e768cb7
Move docs/* to docs/zh/*
1 year ago
400b3914f6
Move docs/zh back to docs.
1 year ago
70cff2d99f
fix: Fixed the state transition error in minCostClimbingStairsDP function ( #839 )
...
Signed-off-by: foursevenlove <foursevenlove@gmail.com>
1 year ago
61e1d1faec
feat(go): add forLoopRecur func ( #816 )
1 year ago
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>
1 year ago
2b59c9ce88
Add Coin change ii in C code ( #834 )
...
* 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 coin_change_ii.c
* Update coin_change_ii.c
* Create CMakeLists.txt
* Update coin_change_ii.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
8b4d3300c3
Add Coin change in C code ( #833 )
...
* 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 coin_change.c
* Update coin_change.c
* Update coin_change.c
* Create CMakeLists.txt
* Update coin_change.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
d75a2eb691
Add Unbounded knapsack in C code ( #832 )
...
* 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 unbounded_knapsack.c
* Update unbounded_knapsack.c
* Update unbounded_knapsack.c
* Create CMakeLists.txt
* Update unbounded_knapsack.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
1364bc52e7
Add Min path sum in C code ( #831 )
...
* 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 min_path_sum.c
* Update min_path_sum.c
* Update min_path_sum.c
* Create CMakeLists.txt
* Update min_path_sum.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
946853431f
Add Knapsack in C code ( #830 )
...
* 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 knapsack.c
* Update knapsack.c
* Update knapsack.c
* Create CMakeLists.txt
* Update knapsack.c
* Update knapsack.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
c6bc10a101
Add Min cost climbing stairs dp in C code ( #828 )
...
* 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 min_cost_climbing_stairs_dp.c
* Update min_cost_climbing_stairs_dp.c
* Update min_cost_climbing_stairs_dp.c
* RollBack vector.h
* Update min_cost_climbing_stairs_dp.c
* Update min_cost_climbing_stairs_dp.c
* Create CMakeLists.txt
* Update min_cost_climbing_stairs_dp.c
1 year ago
21fa72ea9f
Add hanota in C code ( #819 )
...
* Update vector.h
增加功能列表：
获取向量的第 i 个元素
设置向量的第 i 个元素
向量扩容
向量缩容
向量插入元素
向量删除元素
向量交换元素
向量是否为空
向量是否已满
向量是否相等
对向量内部进行排序（升序/降序）
对向量某段数据排序（升序/降序）
* Create hanota.c
* 新增binary_search_recur.c
* Update vector.h
* Delete codes/c/chapter_divide_and_conquer directory
* Create hanota.c
* Update vector.h
* Update hanota.c
* Create CMakeLists.txt
* Update vector.h
* Update hanota.c
* RollBack vector.h
* Update CMakeLists.txt
* Update hanota.c
* Update hanota.c
1 year ago
1f512b105f
refactor: Extend vector.h implementation ( #818 )
...
* 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
* Update vector.h
1 year ago
f1ef7e9d10
Move documents to a sub-directory
...
to support multi-language selector.
1 year ago
04e2a46bcd
fine tune
1 year ago
bcb5bf641a
Update hash_algorithm.md ( #836 )
...
* Update hash_algorithm.md
- Add the hiding property required for the hash algorithm in security domain.
* Update hash_algorithm.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
4355f8d49f
Several bug fixes.
1 year ago
0e3d2ce4bb
feat: Add rust code in binary_tree.md ( #759 )
...
* feat: Add binary_tree.md
* Update binary_tree.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
d86cb0ee5d
Update array.md & hash_map.md ( #827 )
...
* Update array.md
- Update array.md
- Add comments to maintain consistency with implementations in other languages.
* Update hash_map.md
- Update hash_map.md
- Update the filename to correspond with the filenames in the "codes/go" directory.
1 year ago
dbf6c1c68d
fix: typo ( #826 )
1 year ago
98538b924f
Several bugs fixes and improvments;
1 year ago
ddb2f9e024
Update suggestions ( #812 )
...
* Update suggestions
Here I think using "code warehouse" instead of "code warehouse" can eliminate unnecessary ambiguity.
* Update suggestions.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
cbe76b58a2
feat: add rust docs ( #815 )
...
* feat: add rust docs
* Import std types for built_in_hash doc
1 year ago
e8bf5879b0
fix: the rust variable should have a snake case name ( #811 )
1 year ago
5b692968a9
feat: add for-loop-recur rust codes ( #803 )
1 year ago
79ee529b47
Update deque.md ( #808 )
...
* Update deque.md
添加了信息：
其名字"deque"是"double-ended queue"的缩写，反映了这种数据结构的主要特点。"
帮助读者更好记住deque的英文名，也能更好联系到其特性
* Update deque.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
191330e73a
feat: Add C code for the section of intro to DP ( #771 )
...
* Add dynamic programming C language code
* Add dynamic programming chapter C language code
* Modifying errors in files
1 year ago
22be495412
fix(cpp). update hash_map ( #800 )
...
* fix(cpp). update hash_map
遍历 map 还是 k-v 键值对
* Update hash_map.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
1 year ago
ea7eb514fc
Update graph_traversal.md ( #801 )
...
笔误文字重复
1 year ago
e3366363b6
feat(dart): add forLoopRecur and update HashMapOpenAddressing ( #802 )
...
* feat(dart): add forLoopRecur
* feat(dart): update HashMapOpenAddressing
1 year ago
e567d08348
Bug fixes
1 year ago
cbea6c584d
fix Dockerfile
1 year ago
72f243eec3
feat(Swift): update min_cost_climbing_stairs_dp and hash_map_open_addressing ( #792 )
1 year ago
ff8e7ceec5
Several bug fixes.
1 year ago
FreddieLi
krahets
gledfish
lucas
coderlef
hpstory
王作勋
47
Nepenthe
Wang Jianing
易春风
Phoenix0415
花无缺
Flamingo
Turing-1024-Lee
liuyuxin
nuomi1