feat: add tags

anson09 · anson09 · commit 1b78b01a5df3 · 2023-04-09T21:34:04.000+08:00
diff --git a/1_js_theory/async_filter.js b/1_js_theory/async_filter.js
@@ -1,5 +1,6 @@
-/* map version */
+// tags: #async #concurrence
 
+/* map version */
 const asyncFilterByMap = async (arr, predicate) => {
   const results = await Promise.all(arr.map(predicate));
 
diff --git a/1_js_theory/browser_fIle_hash.js b/1_js_theory/browser_fIle_hash.js
@@ -1,3 +1,5 @@
+// tags: #hash #api
+
 // 使用浏览器 API 生成文件 SHA-256 哈希值
 async function getFileHash() {
   const [fileHandle] = await showOpenFilePicker();
diff --git a/1_js_theory/debounce.js b/1_js_theory/debounce.js
@@ -1,3 +1,5 @@
+// tags: #debounce #closure #hot
+
 // 防抖
 function debounce(fn, time) {
   let timeout;
diff --git a/1_js_theory/deep_clone.js b/1_js_theory/deep_clone.js
@@ -1,3 +1,5 @@
+// tags: #clone #recursion #hot
+
 function deepClone(obj, hash = new WeakMap()) {
   if (obj instanceof Date) return new Date(obj);
   if (obj instanceof RegExp) return new RegExp(obj);
diff --git a/1_js_theory/flat.js b/1_js_theory/flat.js
@@ -1,3 +1,5 @@
+//tag: #flat #hot
+
 // 递归版本
 function flattenByRecursion(arr) {
   return arr.reduce((prev, next) => {
diff --git a/1_js_theory/get_value.js b/1_js_theory/get_value.js
@@ -1,3 +1,5 @@
+// tags: #string #regex
+
 // writing a get function to pass test code below
 
 // version 1
diff --git a/1_js_theory/inherits.js b/1_js_theory/inherits.js
@@ -1,3 +1,5 @@
+// tags: #prototype #hot
+
 function inherits(Child, Parent) {
   Child.prototype = Object.create(Parent.prototype);
   Child.prototype.constructor = Child;
diff --git a/1_js_theory/limited_parallel.js b/1_js_theory/limited_parallel.js
@@ -1,3 +1,5 @@
+// tags: #promise #concurrence
+
 /* 实现一个能够控制任务并发数量的函数 */
 function limitedParallel(jobs, limit = 5) {
   let cursor = limit;
diff --git a/1_js_theory/promise_all.js b/1_js_theory/promise_all.js
@@ -1,5 +1,8 @@
+// tags: #promise #hot
+
 // 利用 Promise 实现 Promise.all 方法
 
+// tips:
 // for in -> 数组、字符串、对象
 // for of(可迭代对象) -> 数组、字符串、Map、Set
 // forEach -> 数组、Map、Set
diff --git a/1_js_theory/promise_any.js b/1_js_theory/promise_any.js
@@ -1,3 +1,5 @@
+// tags: #promise
+
 function _reverse(promise) {
   return new Promise((resolve, reject) =>
     Promise.resolve(promise).then(reject, resolve)
diff --git a/1_js_theory/promisify.js b/1_js_theory/promisify.js
@@ -1,3 +1,5 @@
+// tags: #promise #callback
+
 function promisify(fn) {
   return (...args) => {
     return new Promise((res, rej) => {
diff --git a/1_js_theory/pubsub.js b/1_js_theory/pubsub.js
@@ -1,3 +1,5 @@
+// tags: #event #design-mode #hot
+
 class PubSub {
   #evts = {};
 
diff --git a/1_js_theory/rpc.js b/1_js_theory/rpc.js
@@ -1,3 +1,5 @@
+// tags: #rpc #design-mode
+
 // 宿主环境提供线程通信 postMessage(message) 和 addListener((message)=>{}) 方法，封装他们进行 rpc 通讯
 // 调用方式 const res = await rpc('method', ...params);
 
diff --git a/1_js_theory/throttle.js b/1_js_theory/throttle.js
@@ -1,3 +1,5 @@
+// tags: #throttle #closure #hot
+
 // 截流
 function throttle(fn, time) {
   let canRun = true;
diff --git a/2_data_structure/bst.js b/2_data_structure/bst.js
@@ -1,3 +1,5 @@
+// tags: #bst #data-structure
+
 // version 1
 class BinarySearchTreeNode {
   constructor(key, value) {
diff --git a/2_data_structure/graph.js b/2_data_structure/graph.js
@@ -1,3 +1,4 @@
+// tags: #graph #data-structure
 class DirectedGraph {
   constructor() {
     this._vertices = new Map();
diff --git a/2_data_structure/heap.js b/2_data_structure/heap.js
@@ -1,3 +1,5 @@
+// #heap #priority-queue #data-structure
+
 // 堆有最大堆/最小堆, 可用于实现优先级队列、堆排序
 class Heap {
   #MAXHEAP;
diff --git a/2_data_structure/tree.js b/2_data_structure/tree.js
@@ -1,3 +1,5 @@
+// tags: #tree #data-structure
+
 class Node {
   constructor(val) {
     this.val = val;
diff --git a/2_data_structure/trie.js b/2_data_structure/trie.js
@@ -1,3 +1,5 @@
+// tags: #trie #data-structure
+
 class TrieNode {
   constructor(char) {
     this._char = char;
diff --git a/3_algorithm/big_positive_number_add.js b/3_algorithm/big_positive_number_add.js
@@ -1,3 +1,5 @@
+// tags: #string #math
+
 // 大正数相加
 // [link](../leetcode/415_add_strings.js)
 function integerAdd(a, b) {
diff --git a/3_algorithm/bit_arithmetic.js b/3_algorithm/bit_arithmetic.js
@@ -1,3 +1,5 @@
+// tags: #bit
+
 // 整数四则位运算
 
 /* 
diff --git a/3_algorithm/continuous_1.js b/3_algorithm/continuous_1.js
@@ -1,3 +1,5 @@
+// tags: #format
+
 // 输入是 1,2,3,5,7,8,10 输出要求是 1~3 5 7~8 10
 
 function continuous(...args) {
diff --git a/3_algorithm/continuous_2.js b/3_algorithm/continuous_2.js
@@ -1,3 +1,5 @@
+// tags: #format
+
 // 将48位的时间位图格式化成字符串
 
 // 要求：写一个函数timeBitmapToRanges，将下述规则描述的时间位图转换成一个选中时间区间的数组。
diff --git a/3_algorithm/excel_header.js b/3_algorithm/excel_header.js
@@ -1,3 +1,5 @@
+// tags: #math #bit
+
 // question：循环A-Z当超过26个字母时输出AA...AZ...BA..
 
 // A=0，Z=25，则任何进制下AA无法表示26
diff --git a/3_algorithm/knapsack_01.js b/3_algorithm/knapsack_01.js
@@ -1,3 +1,5 @@
+// tags: #dp #knapsack
+
 // top-down
 function knapsack01(weights, values, capacity) {
   const memo = {};
diff --git a/3_algorithm/mid_numbers.js b/3_algorithm/mid_numbers.js
@@ -1,3 +1,5 @@
+// tags: #monotonic-stack
+
 // 给出一个无序可有重复元素的数组，求数组中的所有满足其左边的数都小于它，右边的数都大于它的子元素
 
 // verison 1
diff --git a/3_algorithm/split_coins.js b/3_algorithm/split_coins.js
@@ -1,3 +1,5 @@
+// tags: #backtracking #combination
+
 /*
 一堆硬币，面值可以是从1到500的任意整数，将他们分成两堆，求两堆面值总和的最小差值
 比如 [3,4,5], 那么最小差值是 2
diff --git a/3_algorithm/topk.js b/3_algorithm/topk.js
@@ -1,3 +1,5 @@
+// tags: #topk #quickselect
+
 // 快速选择
 // time: O(N)
 // space: O(N)
diff --git a/4_leetcode/100_same_tree.js b/4_leetcode/100_same_tree.js
@@ -1,3 +1,5 @@
+// tags: #tree #dfs
+
 // https://leetcode.cn/problems/same-tree/
 
 // time: 48ms | beat 99%
diff --git a/4_leetcode/104_maximum_depth_of_binary_tree.js b/4_leetcode/104_maximum_depth_of_binary_tree.js
@@ -1,3 +1,5 @@
+// tags: #tree #dfs #backtracking #hot
+
 // https://leetcode.cn/problems/maximum-depth-of-binary-tree/
 
 // version 1
diff --git a/4_leetcode/136_single_number.js b/4_leetcode/136_single_number.js
@@ -1,3 +1,5 @@
+// tags: #bit
+
 // https://leetcode.cn/problems/single-number/
 
 // version 1
diff --git a/4_leetcode/144_binary_tree_preorder_traversal.js b/4_leetcode/144_binary_tree_preorder_traversal.js
@@ -1,3 +1,5 @@
+// tags: #tree #dfs
+
 // https://leetcode.cn/problems/binary-tree-preorder-traversal/
 
 // 与常规遍历不同，用了原地分解问题思路
diff --git a/4_leetcode/15_3sum.js b/4_leetcode/15_3sum.js
@@ -1,3 +1,5 @@
+// tags: #hashmap #two-pointers
+
 // https://leetcode.cn/problems/3sum/
 
 //三个版本都是 time O(n^2)，在不断做常数项优化
@@ -33,7 +35,7 @@ var threeSum = function (nums) {
   const set = new Set();
   nums.sort((a, b) => a - b);
 
-  for (let i = nums.length; i >= 2; i--) {
+  for (let i = nums.length - 1; i >= 2; i--) {
     j = 0;
     k = i - 1;
     while (j < k) {
diff --git a/4_leetcode/1_two_sum.js b/4_leetcode/1_two_sum.js
@@ -1,3 +1,5 @@
+// tags: #hashmap
+
 // https://leetcode.cn/problems/two-sum/
 
 // version 1
diff --git a/4_leetcode/206_reverse_linked_list.js b/4_leetcode/206_reverse_linked_list.js
@@ -1,3 +1,5 @@
+// tags: #linkedlist #hot
+
 // https://leetcode.cn/problems/reverse-linked-list/
 
 // version 1
diff --git a/4_leetcode/20_valid_parentheses.js b/4_leetcode/20_valid_parentheses.js
@@ -1,3 +1,5 @@
+// tags: #stack #hot
+
 // https://leetcode.cn/problems/valid-parentheses/
 
 // time: O(n) | 52ms | beat 99%
diff --git a/4_leetcode/215_kth_largest_element_in_an_array.js b/4_leetcode/215_kth_largest_element_in_an_array.js
@@ -1,3 +1,5 @@
+// tags: #topk #quickselect
+
 // https://leetcode.cn/problems/kth-largest-element-in-an-array/
 
 // version 1
diff --git a/4_leetcode/21_merge_two_sorted_lists.js b/4_leetcode/21_merge_two_sorted_lists.js
@@ -1,3 +1,5 @@
+// tags: #recursion #linkedlist #hot
+
 // https://leetcode.cn/problems/merge-two-sorted-lists/
 
 // version 1
diff --git a/4_leetcode/26_remove_duplicates_from_sorted_array.js b/4_leetcode/26_remove_duplicates_from_sorted_array.js
@@ -1,3 +1,5 @@
+// tags: #two-pointers
+
 // https://leetcode.cn/problems/remove-duplicates-from-sorted-array/
 
 // time: O(n) | 72ms |beat 67%
diff --git a/4_leetcode/300_longest_increasing_subsequence.js b/4_leetcode/300_longest_increasing_subsequence.js
@@ -1,17 +1,23 @@
+// tags: #backtracking #combination #dp #LIS
+
 // https://leetcode.cn/problems/longest-increasing-subsequence/
 
 // time: O(2^n) | TLE
-var lengthOfLIS = function(nums) {
+var lengthOfLIS = function (nums) {
   let largest = [];
   let current = [];
 
   dfs(0);
   return largest.length;
 
   function dfs(start) {
-    for (let i = start; nums.length - i > largest.length - current.length; i++) {
+    for (
+      let i = start;
+      nums.length - i > largest.length - current.length;
+      i++
+    ) {
       if (current.length !== 0 && nums[i] <= current.at(-1)) continue;
-      current.push(nums[i])
+      current.push(nums[i]);
       if (current.length > largest.length) largest = [...current];
       dfs(i + 1);
       current.pop();
@@ -20,7 +26,7 @@ var lengthOfLIS = function(nums) {
 };
 
 // time: O(2^n) | 108ms | beat 79%
-var lengthOfLIS = function(nums) {
+var lengthOfLIS = function (nums) {
   const dp = [1];
   for (let i = 1; i < nums.length; i++) {
     let max = 0;
@@ -29,5 +35,5 @@ var lengthOfLIS = function(nums) {
     }
     dp[i] = max + 1;
   }
-  return Math.max(...dp)
-}
+  return Math.max(...dp);
+};
diff --git a/4_leetcode/322_coin_change.js b/4_leetcode/322_coin_change.js
@@ -1,3 +1,5 @@
+// tags: #dp #knapsack
+
 // https://leetcode.cn/problems/coin-change/
 
 // version 1
diff --git a/4_leetcode/344_reverse_string.js b/4_leetcode/344_reverse_string.js
@@ -1,3 +1,5 @@
+// tags: #string
+
 // https://leetcode.cn/problems/reverse-string/
 
 // 实现数组 reverse 方法
diff --git a/4_leetcode/349_intersection_of_two_arrays.js b/4_leetcode/349_intersection_of_two_arrays.js
@@ -1,3 +1,5 @@
+// tags: #hashmap
+
 // https://leetcode.cn/problems/intersection-of-two-arrays/
 
 // version 1
diff --git a/4_leetcode/354_russian_doll_envelopes.js b/4_leetcode/354_russian_doll_envelopes.js
@@ -1,3 +1,5 @@
+// tags: #dp #LIS
+
 // https://leetcode.cn/problems/russian-doll-envelopes/
 
 // time: O(n^2) | TLE
diff --git a/4_leetcode/384_shuffle_an_array.js b/4_leetcode/384_shuffle_an_array.js
@@ -1,3 +1,5 @@
+// tags: #math
+
 // https://leetcode.cn/problems/shuffle-an-array/
 
 var Solution = function (nums) {
diff --git a/4_leetcode/415_add_strings.js b/4_leetcode/415_add_strings.js
@@ -1,3 +1,5 @@
+// tags: #math
+
 // https://leetcode.cn/problems/add-strings/
 
 // time: 68ms | beat 68%
diff --git a/4_leetcode/42_trapping_rain_water.js b/4_leetcode/42_trapping_rain_water.js
@@ -1,3 +1,5 @@
+// tags: #two-pointers
+
 // https://leetcode.cn/problems/trapping-rain-water/
 
 // version 1
diff --git a/4_leetcode/46_permutations.js b/4_leetcode/46_permutations.js
@@ -1,3 +1,5 @@
+// tags: #backtracking #permutation
+
 // https://leetcode.cn/problems/permutations/
 
 // time: O(n!) | 80ms | beat 33%
diff --git a/4_leetcode/51_n_queens.js b/4_leetcode/51_n_queens.js
@@ -1,3 +1,5 @@
+// tags: #backtracking
+
 // https://leetcode.cn/problems/n-queens/
 
 // time: 76ms | beat 66%
diff --git a/4_leetcode/70_climbing_stairs.js b/4_leetcode/70_climbing_stairs.js
@@ -1,3 +1,5 @@
+// tags: #dp #hot
+
 // https://leetcode.cn/problems/climbing-stairs/
 
 // version 1
diff --git a/4_leetcode/77_combinations.js b/4_leetcode/77_combinations.js
@@ -1,3 +1,5 @@
+// tags: #backtracking #combination
+
 // https://leetcode.cn/problems/combinations/
 
 // 排列每层都重头找，组合下层从上一层的下一个开始找
diff --git a/README.md b/README.md
@@ -1,17 +1,19 @@
 # README
 
-This project is suited for those who want to promote coding ability systematically 🏗
+This project is suited for those who want to promote full-stack coding ability systematically 🏗
 
 All problems are implemented by vanilla js 💛
 
-## Dirs
+## INDEX
 
 Codes are divided into 4 parts: 🥘
 
-1. [js practice](./1_js_practice)
-2. [data structure](./2_data_structure/)
-3. [algorithm](./3_algorithm/)
-4. [leetcode](./4_leetcode/)
+1. [JS Theory](./1_js_theory/)
+2. [Data Structure](./2_data_structure/)
+3. [Algorithm](./3_algorithm/)
+4. [Leetcode](./4_leetcode/)
+
+You can filter themes by tag #xxx
 
 ## About Leetcode Challenge
 

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// tags: #hash #api`
	`2`	`+`
`1`	`3`	`// 使用浏览器 API 生成文件 SHA-256 哈希值`
`2`	`4`	`async function getFileHash() {`
`3`	`5`	`const [fileHandle] = await showOpenFilePicker();`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// tags: #debounce #closure #hot`
	`2`	`+`
`1`	`3`	`// 防抖`
`2`	`4`	`function debounce(fn, time) {`
`3`	`5`	`let timeout;`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// tags: #clone #recursion #hot`
	`2`	`+`
`1`	`3`	`function deepClone(obj, hash = new WeakMap()) {`
`2`	`4`	`if (obj instanceof Date) return new Date(obj);`
`3`	`5`	`if (obj instanceof RegExp) return new RegExp(obj);`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+//tag: #flat #hot`
	`2`	`+`
`1`	`3`	`// 递归版本`
`2`	`4`	`function flattenByRecursion(arr) {`
`3`	`5`	`return arr.reduce((prev, next) => {`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// tags: #string #regex`
	`2`	`+`
`1`	`3`	`// writing a get function to pass test code below`
`2`	`4`
`3`	`5`	`// version 1`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// tags: #prototype #hot`
	`2`	`+`
`1`	`3`	`function inherits(Child, Parent) {`
`2`	`4`	`Child.prototype = Object.create(Parent.prototype);`
`3`	`5`	`Child.prototype.constructor = Child;`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// tags: #promise #concurrence`
	`2`	`+`
`1`	`3`	`/* 实现一个能够控制任务并发数量的函数 */`
`2`	`4`	`function limitedParallel(jobs, limit = 5) {`
`3`	`5`	`let cursor = limit;`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// tags: #promise`
	`2`	`+`
`1`	`3`	`function _reverse(promise) {`
`2`	`4`	`return new Promise((resolve, reject) =>`
`3`	`5`	`Promise.resolve(promise).then(reject, resolve)`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// tags: #promise #callback`
	`2`	`+`
`1`	`3`	`function promisify(fn) {`
`2`	`4`	`return (...args) => {`
`3`	`5`	`return new Promise((res, rej) => {`
Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// tags: #event #design-mode #hot`
	`2`	`+`
`1`	`3`	`class PubSub {`
`2`	`4`	`#evts = {};`
`3`	`5`