* 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
* 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
* 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
* add permutations_ii.c and re-implement permutations_i.c
* Update the implementation of hash_map_open_addressing.js and .ts
* Update hash_map_open_addressing.js
* Update hash_map_open_addressing.js
* feat: Add javascript and typescript code in chapter_computational_complexity
* docs: Update code comment
* style: update code order th same with java
* 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
* 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
* 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
