* 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>
* 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
* 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>
* 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>
* 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
* 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>
* 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>
* 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>
* 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>
* 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
* 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
* 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>
* 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
* 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
* 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>
* The Rust version of the selection sort.
* The Rust version of the binary_search_edge
* update，The Rust version of the binary_search_edge and selection_sort
* update，The Rust version of the binary_search_edge and selection_sort
* update The Rust version of the binary_search_edge and selection_sort
* feat(go): support hash map chaining
* feat(go): support hash map open address
* feat(go): support simple hash
* feat(go): support top k heap
* feat(go): support subset sum I
* feat(go): support subset sum native
* feat(go): support subset sum II
* fix(go): fix some problem
* Fix the indentation of TS code
* Add JavaScript and TypeScript code of heap sort, selection sort and binary search edge
* Fix the style of JS and TS code
* 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
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat(go/backtracking): add go code
* feat(backtracking): add n_queens in go
* feat(backtracking): add /preorder_traversal_i_compact in go
* feat(backtracking): add /preorder_traversal_ii_compact in go
* feat(backtracking): add /preorder_traversal_ii_template in go
* feat(backtracking): add preorder_traversal_iii_compact in go
* feat(backtracking): add preorder_traversal_test in go
* feat(backtracking): add permutations_i in go
* feat(backtracking): add permutations_ii in go
* feat(backtracking): add permutation_test in go
* feat(backtracking): fix bug in go
* Update permutations_i.go
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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)
* fix(codes/cpp): Fix memory leaks: replace pointers with local variables, no need to manage memory
* fix(codes/cpp): Fix memory leaks: no delete
* fix(codes/cpp): Fix memory leaks: Add destructor ~ArrayHashMap()
* Update PrintUtil.hpp
* feat(codes/c): Add three-party hash implementation
* feat(codes/c): Add freeMemoryTree in tree_node.h
* feat(codes/c): Add space_complexity.c
* styles(codes/c): Modify format
* feat(codes/cpp): Undo a previous delete, there is no memory leak here
* Update array_hash_map.cpp
* Update include.h
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* Add JavaScript and TypeScript code of bucket sort (Chapter of Sorting)
* Add JavaScript and TypeScript code of counting sort (Chapter of Sorting)
* Add JavaScript and TypeScript code of radix sort (Chapter of Sorting)
* 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
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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)
* fix(codes/cpp): Fix memory leaks: replace pointers with local variables, no need to manage memory
* feat(go/counting_sort): support counting_sort in go
* feat(test): support counting_sort_naive testcase
* feat(go/counting_sort): support counting sort
* feat(c/counting_sort): support counting_sort in c
* feat(codes/cpp): Add cmake build method
* feat(codes/cpp): Modify the cpp support version to c++17
* feat(codes/cpp): fix graph_adjacency_list.cpp cannot be compiled into an executable
* style(codes/cpp): Adjust the code to enhance compatibility.
* feat(codes/cpp): Change cpp version from 17 to 11.
* add csharp code graph_bfs and graph_dfs, modify graph adjacency list class inaccessable
* remove unnecessary using
* fix code style issue in comments
* add vertex class for javascript and typescript
* update the adjacencyList
* update the graph_adjacency_list file
* update the implicit type
---------
Co-authored-by: steak-zhuo <zhuoqinyue@gmail.com>
* add chapter_sorting by dart
* fixed style of dart and bug mentioned before
* alter min value of dart
* Update radix_sort.dart
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* add graph_adjacency_matrix for javascript and typescript
* Fix the initial edges
* fix the method
---------
Co-authored-by: steak-zhuo <zhuoqinyue@gmail.com>
* Add heap part js code
* Update heap.md
* Update heap.md
* Format the code style and fix a bug.
* and fix the style in heap.md
* fix the style
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* add linkedlist_deque for typescript and javascript
* update typescript and javascript examples for the deque.md
* keep the same name
* update the doc
* Update deque.md
---------
Co-authored-by: steak-zhuo <zhuoqinyue@gmail.com>
Co-authored-by: Yudong Jin <krahets@163.com>
* Fix bug before commit 5eae708
* Update queue.md
* Update the coding style for JavaScript
* Add JavaScript and TypeScript code for Section Space Complexity
* Add JavaScript and TypeScript code to docs for Section Space Complexity
* Update hashing_search.js
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* add deque in javascript and typescript
* update the variables name
* update the time complexity
* Directly operating on the Array
* fix the ts file
* update the method complexity
* update the js file
---------
Co-authored-by: steak-zhuo <zhuoqinyue@gmail.com>
* copy zig codes of chapter_array_and_linkedlist and chapter_computational_complexity to markdown files
* Update time_complexity.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
