Yudong Jin
cfc273783b
feat: Add glossary and description for "哈希集合" ( #1310 )
2024-04-28 22:00:25 +08:00
curtishd
4d9bbe72e1
Improve the consistency between code and comments in Kotlin ( #1268 )
...
* style(kotlin): Make code and comments consistent.
* style(kotlin): convert comment location.
* style(c): Add missing comment.
* style(kotlin): Remove redundant semicolon, parenthesis and brace
* style(kotlin): Put constants inside the function.
* style(kotlin): fix unnecessary indentation.
* style(swift): Add missing comment.
* style(kotlin): Add missing comment.
* style(kotlin): Remove redundant comment.
* style(kotlin): Add missing comment.
* Update linked_list.kt
* style(csharp,js,ts): Add missing comment.
* style(kotlin): Remove empty lines.
* Update list.cs
* Update list.js
* Update list.ts
* roll back to commit 1
* style(cs,js,ts): Add missing comment in docfile.
* style(kotlin): Use normal element swapping instead of scope functions.
2024-04-13 20:09:39 +08:00
Yudong Jin
3ea91bda99
fix: Use int instead of float for the example code of log time complexity ( #1164 )
...
* Use int instead of float for the example code of log time complexity
* Bug fixes
* Bug fixes
2024-03-23 02:17:48 +08:00
nuomi1
7359a7cb4b
Review Swift codes ( #1150 )
...
* feat(swift): review for chapter_computational_complexity
* feat(swift): review for chapter_data_structure
* feat(swift): review for chapter_array_and_linkedlist
* feat(swift): review for chapter_stack_and_queue
* feat(swift): review for chapter_hashing
* feat(swift): review for chapter_tree
* feat(swift): add codes for heap article
* feat(swift): review for chapter_heap
* feat(swift): review for chapter_graph
* feat(swift): review for chapter_searching
* feat(swift): review for chapter_sorting
* feat(swift): review for chapter_divide_and_conquer
* feat(swift): review for chapter_backtracking
* feat(swift): review for chapter_dynamic_programming
* feat(swift): review for chapter_greedy
* feat(swift): review for utils
* feat(swift): update ci tool
* feat(swift): trailing closure
* feat(swift): array init
* feat(swift): map index
2024-03-20 21:15:39 +08:00
Nan Lei
300a781fab
Update code comment of quadratic in time_complexity ( #1155 )
2024-03-19 02:28:16 +08:00
Yudong Jin
7f43f92ae9
Bug fixes and improvements ( #1152 )
...
* Update avl_tree.md
* Remove the empty space
* Simplify the heading of the paperbook chapter
* Update hash_map_open_addressing.go to the latest version
* Improvements
2024-03-18 13:34:02 +08:00
Yudong Jin
9769e14017
Fix the median_three mehod for quick sort ( #1134 )
...
* Add the section of terminologies.
* fix format
* Fix median_three function for quick sort
* Delete docs/chapter_appendix/terminologies.md
* Update quick_sort.ts
* Update quick_sort.rs
* Update quick_sort.js
2024-03-15 01:06:59 +08:00
Yudong Jin
01c67781fa
Bug fixes and improvements ( #1133 )
...
* Bug fixes
* Update the figure of the JD link
* Unify the code comments of insertion_sort
2024-03-14 20:01:16 +08:00
Yudong Jin
f6976978dd
Prepare 1.0.0 release ( #1044 )
...
* Update the book with the thrid revised edition
* Fix a typo
* Update the contributors' information
* Update the mindmap
* Update the version number
2024-01-14 03:16:20 +08:00
Yudong Jin
ddd375af20
feat: Add visualizing code blocks based on the pythontutor ( #1029 )
...
* Update copyright
* Update the Python code
* Fix the code comments in ArrayBinaryTree
* Fix the code comments in ArrayBinaryTree
* Roll back time_comlexity.py
* Add the visualizing code(pythontutor) blocks to the chapter complexity, data structure, array and linked list, stack and queue, hash table, and backtracking
* Fix the code comments
2024-01-07 04:04:01 +08:00
Yudong Jin
f68bbb0d59
Update the book based on the revised second edition ( #1014 )
...
* Revised the book
* Update the book with the second revised edition
* Revise base on the manuscript of the first edition
2023-12-28 18:06:09 +08:00
Yudong Jin
e720aa2d24
feat: Revised the book ( #978 )
...
* Sync recent changes to the revised Word.
* Revised the preface chapter
* Revised the introduction chapter
* Revised the computation complexity chapter
* Revised the chapter data structure
* Revised the chapter array and linked list
* Revised the chapter stack and queue
* Revised the chapter hashing
* Revised the chapter tree
* Revised the chapter heap
* Revised the chapter graph
* Revised the chapter searching
* Reivised the sorting chapter
* Revised the divide and conquer chapter
* Revised the chapter backtacking
* Revised the DP chapter
* Revised the greedy chapter
* Revised the appendix chapter
* Revised the preface chapter doubly
* Revised the figures
2023-12-02 06:21:34 +08:00
0x6AcE
c5e37c1b41
Simplify the code in array.swift ( #960 )
...
* 简单点
* Apply suggestions from code review
Co-authored-by: nuomi1 <nuomi1@qq.com>
---------
Co-authored-by: Yudong Jin <krahets@163.com>
Co-authored-by: nuomi1 <nuomi1@qq.com>
2023-11-23 15:20:17 +08:00
Yudong Jin
fcbaf101a4
Several bug fixes and improvements ( #945 )
...
* Update Dockerfile for code debugging.
* Format Python code using Black.
* Improve dark theme by defining html classes for the figures, animations and cover images.
* Fix several glossary translation.
* Update a code comment.
* Fix climbing_stairs_backtrack: the pruning should not require the sorted choices list.
* Update the code of array and list traversal.
* Fix a rendering issue of README.md
* Update code of list traversal.
* Fix array_definition.png
* Update README.md
* Fix max_capacity_moving_short_board.png
* Fix array.dart
* Fix array.dart
* Fix array.dart
* Fix array.dart
2023-11-14 21:27:35 +08:00
krahets
5f3ad1ed3d
A few bug fixes.
2023-11-03 22:48:43 +08:00
krahets
355cc3a6b1
Bug fixes to C code.
2023-11-01 05:14:22 +08:00
krahets
db5d1d21f3
Several bug fixes.
2023-10-29 00:09:54 +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
krahets
5392afd44b
fix several bugs
2023-10-17 23:45:31 +08:00
krahets
a8c624fa5a
Fix the code in min_path_sum
2023-10-14 03:25:11 +08:00
krahets
fb552987f5
Update variable names in list and my_list
2023-10-09 18:20:42 +08:00
nuomi1
72f243eec3
feat(Swift): update min_cost_climbing_stairs_dp and hash_map_open_addressing ( #792 )
2023-09-24 09:50:09 -05:00
krahets
ff8e7ceec5
Several bug fixes.
2023-09-24 20:38:21 +08:00
krahets
cb9c14f5ff
fix build_tree, binary_search_tree.cs
...
fix two figures
2023-09-15 02:08:09 +08:00
krahets
f71b2a40da
fix preorder_traversal_iii_compact code
2023-09-09 00:51:00 +08:00
Yudong Jin
9c3b7b6422
Sort the coding languages by applications. ( #721 )
2023-09-04 03:19:08 +08:00
nuomi1
8d5e84f70a
Feature/chapter greedy swift ( #720 )
...
* feat: add Swift codes for greedy_algorithm article
* feat: add Swift codes for fractional_knapsack_problem article
* feat: add Swift codes for max_capacity_problem article
* feat: add Swift codes for max_product_cutting_problem article
2023-09-03 19:09:45 +08:00
nuomi1
b6ac6aa7d7
Feature/chapter divide and conquer swift ( #719 )
...
* feat: add Swift codes for binary_search_recur article
* feat: add Swift codes for build_binary_tree_problem article
* feat: add Swift codes for hanota_problem article
2023-09-02 23:08:37 +08:00
nuomi1
22d1135e04
refactor: remove buildTree ( #716 )
2023-09-02 19:47:54 +08:00
nuomi1
fd84d4443e
feat: add Swift codes for iteration_and_recursion article ( #717 )
2023-09-02 19:47:18 +08:00
krahets
a47a974a6a
fix climbing_stairs_constraint_dp code
2023-08-31 02:31:58 +08:00
krahets
628d8a516b
fix binary_search_tree code
2023-08-31 02:31:31 +08:00
krahets
9731a46d67
Fix a definition.
2023-08-27 00:50:18 +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
932d14644d
Polish the content
...
Polish the chapter preface, introduction and complexity anlysis
2023-08-08 23:16:33 +08:00
nuomi1
fceea4bbda
Feature/chapter searching swift ( #673 )
...
* fix: remove binary_search_edge
* feat: add Swift codes for binary_search_insertion article
* feat: add Swift codes for binary_search_edge article
2023-08-06 23:09:32 +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
nuomi1
a54ec55516
fix: break reference cycling ( #666 )
2023-07-31 03:32:19 +08:00
krahets
b067016bfa
Update preorder_traversal_iii.
2023-07-25 16:39:38 +08:00
nuomi1
9ab4b0b15c
Feature/array representation of tree swift ( #649 )
...
* refactor: encode & decode Tree
* style: build warning
* feat: add Swift codes for array_representation_of_tree article
2023-07-24 12:46:48 +08:00
krahets
bba62bbe75
Fix the code of preorder_traversal_iii_compact
2023-07-21 22:08:26 +08:00
krahets
c54536d1a1
Modify the problem of preorder_traversal_iii
2023-07-19 16:37:12 +08:00
nuomi1
9ea8a73059
Feature/chapter dynamic programming swift ( #608 )
...
* feat: add Swift codes for intro_to_dynamic_programming article
* feat: add Swift codes for dp_problem_features article
* feat: add Swift codes for dp_solution_pipeline article
* feat: add Swift codes for knapsack_problem article
* feat: add Swift codes for unbounded_knapsack_problem article
* feat: add Swift codes for edit_distance_problem article
2023-07-18 12:49:03 +08:00
nuomi1
de4f8378a3
feat: add Swift codes for subset_sum_problem article ( #584 )
2023-07-08 05:27:40 +08:00
nuomi1
b4de2c0d13
feat: add Swift codes for top_k article ( #578 )
2023-07-06 03:16:14 +08:00
nuomi1
87076132e7
feat: add Swift codes for hash_algorithm article ( #576 )
2023-07-03 16:42:49 +08:00
nuomi1
7f8b0fff54
feat: add Swift codes for hash_collision article ( #569 )
...
* feat: add Swift codes for hash_collision article
* refactor: extract common Pair
* Update hash_map.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
2023-07-01 20:39:55 +08:00
nuomi1
9611a8f135
fix: compiler error and reset root ( #570 )
2023-06-30 05:05:07 +08:00
