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

976 commits

Author SHA1 Message Date
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
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
krahets
4bc6b8af7b finetune 2023-08-06 23:19:37 +08:00
hpstory
c14ca74b8b
feat(csharp): add binary search csharp codes (#676) 2023-08-06 23:16:02 +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
krahets
08e4924054 Finetune 2023-08-04 05:25:22 +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
gonglja
9900e0c668
Add array_binary_tree.c and update push_back and pop_back in vector.h (#664) 
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

* fix(codes/c): Fix space_complexity.c build error.

* feat(codes/c): Add array_binary_tree.c

* feat(code/c): Update push_back and pop_back in vector.h

* styles(codes/c): Adjust  format.

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-08-03 14:48:10 +08:00
William Yuan
70784a1ec3
feat(chapter_backtracking): Add js and ts codes for chapter 13.3 (#667) 
* feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1

* style(chapter_dynamic_programming): format code

* refactor(chapter_dynamic_programming): remove main definition and add type

* feat(chapter_backtracking): Add js and ts codes for chapter 13.3

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.2

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.3

* feat(chapter_divide_and_conquer): Add js and ts codes for chapter 12.4

* style(chapter_divide_and_conquer): fix typo

* refactor: Use === instead of == in js and ts
 2023-08-03 14:44:49 +08:00
krahets
6da6d24193 Fix the code of hash map chaining. 2023-08-01 17:05:40 +08:00
nuomi1
a54ec55516
fix: break reference cycling (#666) 2023-07-31 03:32:19 +08:00
krahets
dbe3b4d6ba Fine tune. 2023-07-31 03:27:26 +08:00
gonglja
f7b827b303
Fix space_complexity.c build error. (#663) 
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

* fix(codes/c): Fix space_complexity.c build error.

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-29 18:21:47 +08:00
gonglja
8f5ef68c65
feat: Add C codes for the chapter backtracking (#593) 
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

* feat(codes/c): Add part of the c code in the backtracking chapter

* feat(codes/c): Add preorder_traversal_iii_compact.c

* feat(codes/c): Add preorder_traversal_iii_template.c

* feat(codes/c): Add permutations_i.c

* style(codes/c): Adjust the format

* feat(codes/c): Add memory release in chapter_backtracking

* fix(codes/c): Fix memory release issue.

* style(codes/c): Update format and Merge duplicate code

* style(code/c): Change print format in preorder_traversal_iii_template.c

* Update preorder_traversal_iii_template.c

* Update permutations_i.c

* feat(codes/c): Remove myArray, use public vector.

* feat(codes/c): Add subset_sum_i_naive.c in C codes.

* feat(codes/c): Add permutations_i in CMakeLists.txt

* feat(codes/c): Update printf function in vector.h.

* feat(codes/c): Add subset_sum_i.c and subset_sum_ii.c

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-29 15:14:01 +08:00
yishangzhang
fc63e990c8
fix: Object pointer not deleted (#662) 
* fix: Object pointer not deleted

*  codes/cpp/chapter_hashing

Signed-off-by: yishangzhang <zhangyi2017@cug.edu.cn>

* Update hash_map_chaining.cpp

---------

Signed-off-by: yishangzhang <zhangyi2017@cug.edu.cn>
Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-29 02:08:00 +08:00
William Yuan
35e9c8c209
feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1 (#658) 
* feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1

* style(chapter_dynamic_programming): format code

* refactor(chapter_dynamic_programming): remove main definition and add type
 2023-07-29 02:06:11 +08:00
WangSL
13bb76c283
feat: add rust code for build_in_hash and hash_collision (#629) 
* Create hash_map_chaining.rs

* Create hash_map_open_addressing.rs

* Create build_in_hash.rs

* Update Cargo.toml
 2023-07-26 15:42:47 +08:00
Reanon
575bcf58ef
feat(go/tree): support array binary tree (#655) 2023-07-26 11:04:09 +08:00
Yudong Jin
027bdd6510
Release Rust code to documents. (#656) 2023-07-26 11:00:53 +08:00
krahets
60162f6fa8 Finetune Rust code. 2023-07-26 10:01:49 +08:00
Night Cruising
06006c58a2
feat: add rust codes for array binary tree (#654) 
* feat: add rust codes for array binary tree

* update tree_node.rs

* update: add implementation of vec_to_tree and tree_to_vec

* update tree_node.rs

* Update tree_node.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-26 09:15:58 +08:00
krahets
35973068a7 Prepare for release 1.0.0b4 2023-07-26 03:15:49 +08:00
krahets
b067016bfa Update preorder_traversal_iii. 2023-07-25 16:39:38 +08:00
krahets
90af225dae Remove -> None for Python functions 2023-07-24 22:34:05 +08:00
gonglja
ac0f405f9a
Fix quadraticRecur bug in space_complexity.c (#651) 
* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

* fix(codes/c): Fix quadraticRecur bug in `space_complexity.c`

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-24 22:29:13 +08:00
Night Cruising
fdbe275fc9
fix: check the rust codes and fix them (#653) 
* fix: check the rust codes and fix it

* Update binary_tree_bfs.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-24 22:27:26 +08:00
hpstory
978d3c2ed7
fix(csharp): reformat csharp codes and docs (#652) 
* fix(csharp): reformat the C# codes and docs

* Update time_complexity.md

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-24 19:50:00 +08:00
krahets
1777a16865 Fix Go comment and link 2023-07-24 13:11:00 +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
Reanon
c1adeb2399
feat(go/dp): support dynamic programming (#622) 
* feat(go/dp): support climbing stairs

* feat(go/dp): support knapsack

* feat(go/dp): coin_change & edit_distance
 2023-07-24 03:08:35 +08:00
Reanon
10e5e7499b
feat(go/greedy): add greedy in go code (#648) 2023-07-24 03:06:47 +08:00
Night Cruising
41db3701ab
Update max_product_cutting.java (#647) 2023-07-24 03:05:57 +08:00
Night Cruising
9d56622c75
feat: add rust codes for chapter greedy (#646) 
* feat: add rust codes for chapter greedy

* Update max_product_cutting.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-22 20:35:57 +08:00
hpstory
b43de88f71
feat(csharp): add csharp code for charper greedy (#645) 2023-07-22 02:54:41 +08:00
Hongyun Zhang
eb695937a4
Add divide and conquer go code (#638) 
* feat: Add Go code to binary search recursion under divide and conquer

* style: Code comment standardization

* style: modify function comment

* fix: fixed error when the list is empty

* Update print_utils.go

* Delete print_utils_test.go

* feat: add Go code to divide and conquer

* Update build_tree.go

* style: modify function name

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-21 22:16:42 +08:00
krahets
bba62bbe75 Fix the code of preorder_traversal_iii_compact 2023-07-21 22:08:26 +08:00
Yudong Jin
075c3abf88
Add the section of max product cutting problem. (#642) 2023-07-21 21:56:14 +08:00
krahets
1a55dbdf2e Finetune doc and code. 2023-07-21 15:18:01 +08:00
Yudong Jin
76f11ae168
Add the section of max capacity problem. (#639) 2023-07-21 15:16:51 +08:00
Hongyun Zhang
8068c42688
fixed error when the list is empty (#637) 
* feat: Add Go code to binary search recursion under divide and conquer

* style: Code comment standardization

* style: modify function comment

* fix: fixed error when the list is empty

* Update print_utils.go

* Delete print_utils_test.go

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-21 14:47:37 +08:00
NI-SW
da2c71d936
add c code for graph operation (#601) 
* Create chapter_graph

* Delete chapter_graph

* add C code for graph

* add C code for graph

* Create graph_adjacency_list.c

add C code for graph

* Update CMakeLists.txt

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update graph_adjacency_list.c

* Update CMakeLists.txt for c code of graph

* Update format of c code

* Update format of c code

* Update format of c code

* Update verticesList

Change the data structure of the storage list from a linked list to a linear table

* Update graph_adjacency_list.c

* Update graph_adjacency_matrix.c

* Create graph_adjacency_list_test.c

* Create graph_bfs

* Update CMakeLists.txt

* Update graph_adjacency_list.c

* mv graph_bfs to graph_bfs.c

* Update graph_bfs.c

* Delete graph_bfs

* Update graph_adjacency_list.c

* update c code for graph operation.

* Update CMakeLists.txt

* Update graph_dfs.c

* Update graph_dfs.c

* Update CMakeLists.txt

* Update graph_dfs.c

* Update note of graph_dfs.c

* Update graph_bfs.c

* Update graph_dfs.c

* Update graph_bfs.c

* Update output "初始化后，图为：" of graph_dfs.c

* Update graph_dfs.c

* Update graph_bfs.c

* Update graph_dfs.c

* Update name of arrayVertex

* Update name of arrayVertex

* Update note of graph_dfs.c

* Update note of graph_bfs.c

* Update graph_dfs.c

* Update graph_bfs.c

* Update graph_adjacency_matrix.c

* Update graph_adjacency_list_test.c

* Update graph_adjacency_list.c

* Update graph_dfs.c

* Update graph_bfs.c

* Update comment

* Update comment

* Update graph_adjacency_list.c

* Update graph_adjacency_matrix.c

* update comment

* update comment

* update comment for graph operation

* update comment of graph operation

* update comment

* update comment

---------

Co-authored-by: Yudong Jin <krahets@163.com>
Co-authored-by: libr <libr@info2soft.com>
 2023-07-20 19:08:23 +08:00
Hongyun Zhang
4e4a13e1bb
feat: Add Go code to binary search recursion under divide and conquer (#630) 
* feat: Add Go code to binary search recursion under divide and conquer

* style: Code comment standardization

* style: modify function comment
 2023-07-20 18:57:28 +08:00
hpstory
2af77ff565
feat(csharp): add csharp code for array binary tree (#632) 2023-07-20 18:54:40 +08:00
Yudong Jin
2b7d7aa827
Add the chapter of greedy. (#633) 
Add the section of fractional knapsack.
 2023-07-20 18:26:54 +08:00
krahets
c54536d1a1 Modify the problem of preorder_traversal_iii 2023-07-19 16:37:12 +08:00
krahets
4e13755023 Add implementation of array binary tree. 
Rewrite the tree serialization and deserialization methods.
Add applications of array and linked list.
 2023-07-19 16:09:27 +08:00
krahets
c68f18e480 Finetune 2023-07-19 01:45:14 +08:00
ZongYangL
03cbf5b972
Anonymous inner classes create generic instances that display the dec… (#627) 
* Anonymous inner classes create generic instances that display the declared type

* Update TreeNode.java

* Update binary_tree_bfs.java

* Update graph_bfs.java

---------

Co-authored-by: zongjianwei <zongjianwei@meituan.com>
Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-19 01:37:55 +08:00
hpstory
7a6fd4b3dd
feat(csharp): add csharp code for charper divide and conquer (#628) 2023-07-19 01:19:49 +08:00
sjinzh
8737fc66dd
rust : add codes for chapter_divide_and_conquer (#621) 2023-07-19 00:32:05 +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
krahets
1f784dadb0 Add Java and C++ code for the chapter of 
divide and conquer.
 2023-07-17 04:20:12 +08:00
krahets
fc7bcb615d Add the section of binary_search_recur. 2023-07-17 03:48:33 +08:00
Yudong Jin
909daea105
Add the section of hanota problem. (#614) 2023-07-17 02:20:49 +08:00
krahets
f839dc1b0e Fix naming of the section 
build_binary_tree_problem
 2023-07-17 02:18:53 +08:00
Night Cruising
a296786b2a
feat: add rust codes for chapter heap (#612) 
Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-16 15:40:25 +08:00
sjinzh
ead33ca863
zig : update codes style && rust : add codes for chapter_backtracking. (#613) 
* zig : update codes style

* rust : add codes for chapter_backtracking

* zig : update codes style
 2023-07-16 15:36:28 +08:00
Yudong Jin
51a4c5089e
feat: Add the chapter of divide and conquer (#609) 
* Add the chapter of divide and conquer.
Add the section of divide and conquer algorithm.
Add the section of build tree problem.

* Update build_tree.py
 2023-07-16 04:24:04 +08:00
Night Cruising
f5ea4fa1c6
feat: add rust codes for avl tree (#605) 
* feat: add rust codes for avl tree

* fix a wrong usage of borrow method of RefCell

* Update avl_tree.rs

* fix comment indentation and field define of TreeNode

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-16 01:32:43 +08:00
sjinzh
b1f8857212
rust and zig : add codes for chapter_dynamic_programming (#606) 
* rust : add codes for chapter_dynamic_programming

* zig : add codes for chapter_dynamic_programming

* rust : add codes for chapter_backtracking

* Update n_queens.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-15 23:16:02 +08:00
hpstory
5c09add1ec
feat(csharp): add csharp code for edit distance (#604) 2023-07-14 13:34:28 +08:00
Night Cruising
c3add62dc7
feat: add rust codes for graph chapter (#598) 
* feat: add rust codes for graph chapter

* update: remove Vertex and it's method to vertex.rs
 2023-07-14 00:47:32 +08:00
hpstory
c9a8b0a9ea
feat(csharp): add csharp code for unbounded knapsack (#596) 2023-07-13 15:49:40 +08:00
Yudong Jin
c3f80e52af
Add the section of edit distance problem (#599) 2023-07-13 05:27:47 +08:00
Night Cruising
f548eae663
feat: add rust codes for bucket sort, counting sort and radix sort (#590) 
* add rust codes for bucket sort, counting sort and radix sort

* update Cargo.toml for build
 2023-07-12 00:29:39 +08:00
sjinzh
6733a4843c
rust : add codes for chapter_backtracking (#594) 
* rust : add codes for chapter_backtracking

* Update subset_sum_ii.rs

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-12 00:01:57 +08:00
NI-SW
c36010b324
add C code for graph (#583) 
* Create chapter_graph

* Delete chapter_graph

* add C code for graph

* add C code for graph

* Create graph_adjacency_list.c

add C code for graph

* Update CMakeLists.txt

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update format and output

* Update graph_adjacency_list.c

* Update CMakeLists.txt for c code of graph

* Update format of c code

* Update format of c code

* Update format of c code

* Update verticesList

Change the data structure of the storage list from a linked list to a linear table

* Update graph_adjacency_list.c

* Update graph_adjacency_matrix.c

* Create graph_adjacency_list_test.c

* Create graph_bfs

* Update CMakeLists.txt

* Update graph_adjacency_list.c
 2023-07-11 23:50:51 +08:00
krahets
1c02859b13 Add the section of unbounded knapsack problem. 2023-07-11 19:22:41 +08:00
krahets
ad0fd45cfb Add Java and C++ code for the chapter of DP. 2023-07-11 01:08:26 +08:00
krahets
465dafe9ec Update the text and code of DP. 2023-07-10 20:36:48 +08:00
hpstory
5ea016816a
fix(csharp): fix csharp method name in knapsack (#592) 
* fix(csharp): fix csharp method name in knapsack

* feat(csharp): add csharp code for min path sum

* move INF define into method

* change INF to int max value
 2023-07-10 17:34:54 +08:00
sjinzh
459449d41a
zig : upgrade codes && rust : add codes for chapter_searching and chapter_dynamic_programming. (#591) 
* zig : update zig codes

* rust : add codes for linear_search and hashing_search

* rust : add codes for linear_search and hashing_search

* rust : add codes for chapter_dynamic_programming
 2023-07-10 01:32:12 +08:00
Night Cruising
6c133d42d5
rust code for heap sort (#579) 2023-07-09 03:01:44 +08:00
Yudong Jin
d6cc92614c
add the section of dp solution pipeline (#588) 2023-07-09 02:43:00 +08:00
krahets
cddddb8b8b Update knapsack_problem and intro_to_dp 
Fix avl_tree
 2023-07-09 02:39:58 +08:00
hpstory
cbfb9e59ad
feat(csharp): add csharp code for knapsack (#585) 2023-07-08 05:28:39 +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
Yudong Jin
55d8b710fa
Add the section of knapsack problem. (#580) 2023-07-06 00:06:14 +08:00
krahets
470bc10a74 Fix some contents. 2023-07-06 00:04:11 +08:00
Jerry You
763955aa8b
fix: removeEdge not effects on graph in golang (#503) 
* fix(graph/adjacency_list):removeEdge not effects on graph in golang

* remove unecessary package right now

* Delete go.sum

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2023-07-04 21:08:32 +08:00
hpstory
bf1bccc1ae
feat(csharp): add csharp code for charper dynamic programming (#574) 
* feat(csharp): add csharp code for charper dynamic programming

* add climbing_stairs_constraint_dp
 2023-07-03 16:44:43 +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
krahets
69920a0599 Fix binary search. 
Finetune a figure in intro_to_dp.
 2023-07-01 20:07:21 +08:00
krahets
920512d872 Update the section of intro to DP. 2023-07-01 03:02:50 +08:00
krahets
ba481cb8e6 Simplify the python code of bst and avl tree. 2023-06-30 05:17:30 +08:00
krahets
98e797f1fc Fix the bst python code. 
Fitune the chapters name.
 2023-06-30 05:09:17 +08:00
nuomi1
9611a8f135
fix: compiler error and reset root (#570) 2023-06-30 05:05:07 +08:00
Yudong Jin
3f03663d2e
feat: add the section of the introduction to dynamic programming (#571) 
* add the section of the introduction to
dynamic programming

* add a code comments.
 2023-06-30 04:31:43 +08:00
hpstory
4722e7bca7
feat(csharp/hashing): add code and update docs to chapter hashing (#568) 
* feat(csharp/hashing): add code and update docs to chapter hashing

* revert linked list to list
 2023-06-26 23:08:55 +08:00