2110 Commits

Author SHA1 Message Date
372c537187 Sync zh and zh-hant versions. 2025-06-12 21:40:11 +08:00
3a6bd2cf41 Update landing pages. 2025-06-12 21:39:08 +08:00
c3c991e1e9 Fix the "尾递归优化" to "递归深度优化" in quick_sort. 2025-06-12 21:38:43 +08:00
6a4d62449c Update max_product_cutting_problem.md (#1758)
* Update max_product_cutting_problem.md

本节结尾的正确性证明中,

"使用反证法,只分析 n >= 3 的情况。"

这句是否应该改为 “只分析 n >= 4 的情况”,因为 n == 3 时,由于题目要求至少将 n 切分为两个正整数,所以此时应该切分为 1 * 2 ,切分方案里是包含 1 的 😁;
此外,对于这句描述:

“假设最优切分方案中存在 >= 4 的因子 x ,那么一定可以将其继续划分为 2(x-2) ,从而获得更大的乘积。”

最后半句改为“从而获得更大或可替代的乘积”是否更好,因为当切分方案中存在 4 作为因子时,将其划分为 2 * 2,乘积相对划分前是相等的。不过这处改动不影响“所有因子 <= 3” 的结论,因为因子 4 是可以被替代的。

* Update max_product_cutting_problem.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2025-06-12 21:10:15 +08:00
ceec0eaa3a Specify currency unit in the "Price" row of the storage compar… (#1755)
* Specify currency unit as CNY in the "Price" row of the storage comparison table

* Revert changes to the English version

* Change currency unit to USD

* fix

* fix space

* Update ram_and_cache.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2025-06-12 20:57:47 +08:00
7751ea1256 update rust heap (#1761) 2025-06-12 20:47:47 +08:00
5a4aa8c554 en: fix picture file name (#1764) 2025-06-12 20:46:31 +08:00
db64108e5d Bug fixes (#1766)
* Sync zh and zh-hant versions.

* Bug fixes.
2025-06-12 20:45:41 +08:00
f42cec0f88 fix(graph): enhance the judgment of boundary conditions for removeEdge functions (#1412) 2025-05-17 17:26:38 +08:00
09f7223067 optimized the js api use of counting_sort chapter for Math.max() (#1748)
* Update counting_sort.ts optimized the Math.max

* Update counting_sort.ts

* Update counting_sort.js

* Update radix_sort.ts

* Update radix_sort.js
2025-05-17 17:17:22 +08:00
e79a56f540 Update Zig example code (#1737) 2025-05-17 17:15:30 +08:00
e4f5787685 Translation: Update intro_to_dynamic_programming.md (#1751)
* Update intro_to_dynamic_programming.md

* Update intro_to_dynamic_programming.md

Made corrections and improvements to the introduction of dynamic programming based on reviewer suggestions.

* Update intro_to_dynamic_programming.md

Again, I made corrections and improvements to the introduction of dynamic programming based on reviewer suggestions.

* Update intro_to_dynamic_programming.md

chore: corrected missed feedback/suggestion from review
2025-05-17 17:14:43 +08:00
3ad70167db Fix typo in Traditional Chinese translation of binary search (#1750)
線上性查詢 -> 線性查詢
2025-05-17 17:14:32 +08:00
f9d37e0d16 Update en/README. Bug fixes. (#1742)
* Fix graph_operations.md

* Update README

* Sync zh and zh-hant versions.
2025-04-27 16:56:24 +08:00
1904bb8afc Add origins in giscus.json. Update en/README.md. (#1740)
* Fix the definition of "complete binary tree" in binary_tree.md

* Update en/README.md

* Add origins in giscus.json
2025-04-27 16:07:22 +08:00
e1f0903bf7 translation: Update n_queens_problem.md (#1676)
* Update n_queens_problem.md

* translation: Update n_queens_problem.md
2025-04-26 00:47:07 +08:00
cc0852fae8 translation: update chapter_backtracking/summary.md (#1671)
* update chapter_backtracking/summary.md

* translation: update chapter_backtracking/summary.md

* translation: update chapter_backtracking/summary.md
2025-04-26 00:46:10 +08:00
9997c2822c translation: backtracking algorithm (#1669)
* translation: backtracking algorithm

* resolve comments
2025-04-26 00:45:01 +08:00
d976116292 Bug fixes and improvements (#1735)
* Fix the definition of "complete binary tree" in binary_tree.md

* Update en/README.md
2025-04-15 16:57:31 +08:00
8e38c61455 Bug fixes and improvements (#1732)
* Bug fixes

* Sync zh and zh-hant versions.

* "入列列" -> "入佇列"

* Fix hello_algo_mindmap.png
2025-04-10 19:21:52 +08:00
a9d44c3a25 fix(zh-hant translation): graph_traversal.md (#1711)
* 修正 graph_traversal.md 繁體中文版錯誤的文字

`列列` -> `隊列`

* Update graph_traversal.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2025-03-28 17:09:29 +08:00
3177d35eb2 Update the description of time and space complexity of fractional_knapsack problem. (#1688)
* 优化分数背包的部分复杂度描述,使其更加严谨

* Update fractional_knapsack_problem.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2025-03-20 19:46:17 +08:00
1db2001e9b tanslation: Update chapter_backtracking / permutations_problem.md (#1664)
* tanslation: Update chapter_backtracking / permutations_problem.md

* Update permutations_problem.md

* Update permutations_problem.md

* Update permutations_problem.md

* Update permutations_problem.md

* Update permutations_problem.md
2025-03-14 17:56:41 +08:00
0a3d3940c4 Merge pull request #1681 from rongyi/main
tiny fix, more readable rust
2025-03-11 16:56:33 +08:00
bd03b8c66e tiny fix, more readable rust 2025-03-10 17:22:06 +08:00
7e904c8ff6 Update counting_sort.py (#1677)
Since the max function is called to find the maximum value, it doesn't seem necessary to traverse the list and call the max function several times to select the larger value.
2025-03-09 06:39:32 +08:00
82fa8cb222 Fix the typo in backtracking/summary.md (#1673) 2025-03-09 06:36:17 +08:00
f45f847742 translation: Update chatpter_dynamic_programming / index.md (#1668)
* translation: Update chatpter_dynamic_programming / index.md

* Update index.md
2025-03-09 06:35:04 +08:00
8e3b795599 translation: chapter_divide_and _conquer / Update hanota_problem.md (#1657)
* translation: chapter_divide_and _conquer / Update hanota_problem.md

* Update hanota_problem.md

* Update hanota_problem.md
2025-03-09 06:33:14 +08:00
59bd843953 translation: Update chapter_divide_and_conquer / build_binary_tree_pr… (#1653)
* translation: Update chapter_divide_and_conquer / build_binary_tree_problem.md

* Update build_binary_tree_problem.md

preorder-> pre-order
inorder -> in-order

* Update build_binary_tree_problem.md

* Update build_binary_tree_problem.md

* Update build_binary_tree_problem.md

* Update build_binary_tree_problem.md

* Update build_binary_tree_problem.md

* Update build_binary_tree_problem.md
2025-03-09 06:32:30 +08:00
2fcdd499ea translation: Update chapter_sorting / bubble_sort.md (#1646)
* translation: Update chapter_sorting / bubble_sort.md

* Update bubble_sort.md

line 3 updated. 'reminiscent of' - > 'like'

* Update bubble_sort.md

* Update bubble_sort.md

* Update bubble_sort.md

* Update bubble_sort.md
2025-03-09 06:29:03 +08:00
18a5fec836 translate merge_sort.md (#1645)
* translate merge_sort.md

* translate merge_sort.md

* sub-array, postorder --> subarray, post-order

* Fix the typo

* fix the typo

* Update merge_sort.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2025-03-09 06:28:27 +08:00
e3170c372a translation: update counting_sort.md (#1638)
* doc: update translations

* doc: update translations

* doc: update translations

* doc: optimize translations

* doc: optimize translations
2025-03-09 06:27:04 +08:00
f5282698d5 Fix the comma (#1672) 2025-02-26 05:08:11 +08:00
98cd3a8076 fix: update the implementation of simple_hash.js and .ts (#1656) 2025-02-25 04:54:48 +08:00
35c1885b3e translation update: divide and conquer (#1659)
* translation update: divide and conquer

* resolve comments

* resolve further comments
2025-02-25 04:51:26 +08:00
34b01c12d6 translation: Update chatper_backtracking / index.md (#1655)
* translation: Update chatper_backtracking / index.md

* Update index.md
2025-02-25 04:49:33 +08:00
0114546a31 translation: Update chapter_sorting/quick_sort.md (#1637)
* translation: Update chapter_sorting/quick_sort.md

* Update quick_sort.md

* translate quick_sort.md

* sub-array --> subarray

* update quick_sort.md
2025-02-25 04:38:55 +08:00
16fbc4979f translation: update insertion_sort.md (#1630)
* translation: update insertion_sort.md

* fix: revise insertion_sort.md translation

* fix: revert title name

* fix: updating `key` to `base`
2025-02-25 04:38:19 +08:00
9dfd0217a3 translation: Update chapter_divide_and_conquer / summary.md (#1647)
* translation: Update chapter_divide_and_conquer / summary.md

* Update summary.md

* Update summary.md - line 8

line 8 'usually' -> 'typically'

* Update summary.md

line 9 was refined

* Update summary.md

line 10 'splitting' -> 'partitioning'
2025-02-15 21:24:29 +08:00
e19276a5f1 translation: update bucket sort translation (#1639)
* update bucket sort translation

* resolve comments
2025-02-15 21:16:58 +08:00
3a309c88af translation: optimize translation for selection sort (#1600)
* optimize translation for selection sort

* update selection sort translation
2025-02-15 21:14:17 +08:00
4ff889c249 translation: Update binary_search_insertion.md and binary_search_edge.md (#1554)
* translation: Update binary_search_insertion.md

* fix: Clarify binary search insertion and multiple targets handling

* fix: Update binary search insertion title and nav link

* translation: update binary_search _edge.md

* Fix typos and clarify binary search edge cases

* fix: Revert binary search insertion title

* revert the chapter 10.2 title

* Update binary_search_insertion.md

* Update binary search insertion and binary search edge

---------

Co-authored-by: Yudong Jin <krahets@163.com>
2025-02-14 22:14:59 +08:00
00738f5bb4 idomatic rust (#1652)
* idomatic rust

* Update linkedlist queue/deque
2025-02-10 10:40:29 +08:00
eec69f45af translation: chapter_sorting/index.md (#1644) 2025-02-10 10:38:24 +08:00
95bd58b0d0 Translation: Update index.md (#1633)
Chapter 12 of "divide and conquer
2025-02-10 10:36:17 +08:00
2725e5a9dc Translation: Update radix_sort.md (#1632)
* Translation: Update radix_sort.md

* Translation Update radix_sort.md

fixed errors mentioned by yuelinxin
2025-02-10 10:35:52 +08:00
387f93b56f Translation: Update heap_sort.md (#1631)
* Translation: Update heap_sort.md

* Translation: Update heap_sort.md

updated per yuelinxin's suggestion.
2025-02-10 10:35:18 +08:00
3d12f84a01 translation: Update summary.md (#1629)
* translation: Update summary.md

* translation: Update summary.md

re-edited the radix sort part. my main worry is the radix sort and bucket sort, Im just wondering if I actually refined it well or not

* Translation: Update summary.md

updated as per  yuelinxin's suggestions.
2025-02-10 10:34:20 +08:00
4c181c45c5 translation: Update heap.md (#1604)
* heap.md

* Update heap.md

* Update heap.md
2025-02-03 16:50:10 +08:00