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

2041 commits

This branch
This branch
All branches
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
一代咩神
bc80234994
Update linked_list.md (#708) 
原文：

> 单向链表：即上述介绍的普通链表。单向链表的节点包含值和指向下一节点的引用两项数据。我们将首个节点称为头节点，将最后一个节点成为尾节点，尾节点指向空 None。

应该是：将最后一个节点称为（而不是 “成为”）尾节点，尾节点指向空 None。
 2023-08-30 15:26:10 +08:00
krahets
63aef4ed08 Fix a figure and latex symbols. 2023-08-30 15:25:03 +08:00
gaofer
1b94b77cbb
Add code in javascript and typescript. (#690) 
* Add binary_search_insertion and binary_search_edge code in javascript and typescript.

* code style fix: in FOR loop, use CONST will be nicer.

* fix: Code Style

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

* Update codes/javascript/chapter_searching/binary_search_edge.js

Co-authored-by: Justin Tse <xiefahit@gmail.com>

* style fix: Delete unnecessary defined type

---------

Co-authored-by: Justin Tse <xiefahit@gmail.com>
 2023-08-30 05:21:47 +08:00
Yudong Jin
e16f898a4e
Finetune all the figures. (#704) 2023-08-30 05:20:43 +08:00
krahets
db7975d51f Fix some figures. 2023-08-30 02:52:50 +08:00
krahets
d387d9d41d finetune 2023-08-29 20:57:37 +08:00
XiaChuerwu
cf0d4b32ec
Added destructor function (#702) 
* Added destructor function

* Fixed hash function

* Added hash_map_chaining.c file

* Amendment submission

* Delete hash_map_chaining.c

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-08-29 20:24:42 +08:00
krahets
88a746f493 finetune 2023-08-28 23:52:41 +08:00
YDJ
2f0f154b3c
Update binary_search.md (#699) 2023-08-28 23:45:51 +08:00
YDJ
beea47eb5d
Update backtracking_algorithm.md (#700) 2023-08-28 23:45:13 +08:00
Richard Zhang
3cd0352f17
fix: typo (#701) 2023-08-28 23:44:14 +08:00
hpstory
8528ae224e
feat(csharp): add the section of iteration and recursion (#697) 2023-08-28 13:36:41 +08:00
Reanon
20f53e9fc4
feat(go): add iterration/recursion & fix bugs (#698) 2023-08-28 13:35:39 +08:00
krahets
8347c2da36 Update the chapter of 
introduction and complexity anylysis.
 2023-08-28 04:34:25 +08:00
liuyuxin
50e17905fd
feat: Add Dart Codes for section_iteration_and_recursion (#696) 2023-08-28 00:50:26 +08:00
krahets
57851ab11e Update punctuation 2023-08-27 23:40:39 +08:00
krahets
c5a7323817 Replace "：" with "。" 2023-08-27 22:49:47 +08:00
krahets
71692af8c4 Fix a figure. 2023-08-27 19:22:02 +08:00
krahets
9731a46d67 Fix a definition. 2023-08-27 00:50:18 +08:00
Liang Zhang
debf42b189
Fix a typo (#695) 2023-08-26 23:24:46 +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
f524b957d4 Finetune and fix 2023-08-24 17:48:35 +08:00
Reanon
628a274b50
feat(go): support binary search & fix comments (#691) 2023-08-23 21:32:40 +08:00
krahets
1aa558bd2d Add figure and table numbers in normal texts. 2023-08-22 13:51:25 +08:00
krahets
106f02809a Mention figures and tables in normal texts. 
Fix some figures.
Finetune texts.
 2023-08-21 19:33:45 +08:00
krahets
1aff6d6cc2 Polish the content. 2023-08-21 03:57:09 +08:00
krahets
f5dda8d99a Polish the content 2023-08-21 03:06:53 +08:00
krahets
981144e42d 1. lower-case nouns 
2. fix 2 figures
3. Replace some 「」 by “”
 2023-08-20 23:28:30 +08:00
krahets
2626de8d0b Polish the chapter 
introduction, computational complexity.
 2023-08-20 14:51:39 +08:00
krahets
5fb728b3d6 Update H1 titles. 2023-08-20 13:37:49 +08:00
krahets
70227c82cb Remove center-table from docs. 
Add header to the tables.
 2023-08-19 19:22:08 +08:00
Sizhuo Long
4eb621dda7
"Add Q&A sections to array/linked_list and tree chapters" (#682) 
* "Add Q&A sections to array/linked_list and tree chapters"

Added question and answers related to the use of std::list in C++ and space complexity in full binary tree traversal to their respective chapters in array_and_linked_list and tree documentation.

* Update summary.md

* Update summary.md

* Update summary.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-08-18 02:49:53 +08:00
krahets
c310edb672 Polish the chapter of array and linkedlist 2023-08-17 05:13:19 +08:00
liuyuxin
0858ab91c0
Add missing Dart codes and fix some errors (#689) 
* Add missing Dart codes and fix some errors

* Update array_binary_tree.dart

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-08-17 05:04:38 +08:00
Justin Tse
5d7e0a59b1
Add JavaScript and TypeScript code of top_k and update some code style (#686) 
* Update JS and TS code style

* Add JavaScript and TypeScript code of top_k

* Update top_k.ts

* Apply suggestions from code review

Co-authored-by: Justin Tse <xiefahit@gmail.com>

* Apply suggestions from code review

Co-authored-by: Justin Tse <xiefahit@gmail.com>

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-08-17 05:00:35 +08:00
liuyuxin
4c75c204f3
feat: Add Dart codes for binary search (#688) 2023-08-14 23:07:20 +08:00
hpstory
c9006c3fe6
fix(docs): add official configuration tutorial for csharp (#687) 
* fix(docs): add official configuration tutorial for csharp

* Update installation.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-08-14 23:06:11 +08:00
Night Cruising
5a4182372c
Fix the bug of index in rust codes (#685) 2023-08-14 00:54:15 +08:00
krahets
0c18198c01 Fix the figures. 
Polish the chapter of data structure.
 2023-08-13 19:32:11 +08:00
William Yuan
ec82be7dc2
feat(tree): Add the array representation of the binary tree(js,ts) (#681) 
* fix: fixed the bug of arrToTree function

* feat(tree): Add the array representation of the binary tree(js,ts)

* refactor: Make the arrToTree method match the method in java
 2023-08-13 19:30:50 +08:00
liuyuxin
10c397b172
feat: Add Dart codes for chapter_dynamic_programming and chapter_greedy (#683) 
* feat: Add Dart codes for chapter_dynamic_programming

* feat: Add Dart codes for chapter_greedy
 2023-08-13 19:29:54 +08:00
liuyuxin
4325974af1
feat: Add Dart codes for chapter_backtracking and chapter_divide_and_conquer (#680) 
* feat: Add Dart codes for chapter_backtracking

* feat: Add Dart codes for chapter_divide_and_conquer

* Format Dart Code
 2023-08-10 23:48:56 +08:00
William Yuan
e97eee0e18
feat(chapter_hashing): Add js and ts codes for chapter hashing (#675) 
* refactor(chapter_hashing): Remove unnecessary chaining operator

* feat(chapter_hashing): Add js and ts codes for chapter 6

* refactor(chapter_hashing): Optimize the remove function logic

* refactor(chapter_hashing): Remove unnecessary chaining operator

* refactor(chapter_hashing): use const instead of let
 2023-08-10 23:04:41 +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
埃拉
9ed16db68e
Complement to Rust code in the Chapter array and linked list / Time Complexity. (#657) 
* Complement to Rust code in the Chapter array and linked list

* Complement to Rust code in the Time Complexity

* Remove this Rust struct from 380 to 383.

* Address the comments from @night-cruise

* Add more comments in list and time complexity

* Add more comments in linked list
 2023-08-07 18:22:04 +08:00
krahets
4bc6b8af7b finetune 2023-08-06 23:19:37 +08:00