* 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
* 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
* Fix binary_search_tree TS code
* Update binary_search_tree js code style
* Add the JavaScript code for Chapter of Greedy
* Add the TypeScript code for Chapter of Greedy
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat(JS and TS):add the section of iteration and recursion
* feat(JS and TS):add the section of iteration and recursion
* feat(JS and TS):add the section of iteration and recursion
* 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
* 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>
* 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
* 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
Yudong Jin
nuomi1
Justin Tse
gaofer
Night Cruising
hpstory
liuyuxin
XiaChuerwu
Reanon
William Yuan
gonglja