feat<grease>: use Deno lint.

Author: protogenesis

.prettierrc

@@ -0,0 +1,19 @@
+{
+  "fmt": {
+    "indentWidth": 2,
+    "semiColons": false,
+    "singleQuote": true,
+    "proseWrap": "preserve",
+    "include": [
+      "src/"
+    ],
+    "exclude": []
+  },
+  "lint": {
+    "rules": {
+      "exclude": [
+        "no-extra-semi"
+      ]
+    }
+  }
+}

deno.json

@@ -1,17 +1,15 @@
 function bubbleSort(arr: number[]) {
-  for(let i = 0; i < arr.length; i++) {
-    for(let j = i + 1; j < arr.length; j++) {
-      if(arr[i] > arr[j]) {
-        const temp = arr[i]
-        arr[i] = arr[j]
-        arr[j] = temp
-      }
-    }
-  }
-  console.log(arr)
-  return arr
+	for (let i = 0; i < arr.length; i++) {
+		for (let j = i + 1; j < arr.length; j++) {
+			if (arr[i] > arr[j]) {
+				;[arr[i], arr[j]] = [arr[j], arr[i]]
+			}
+		}
+	}
+	console.log(arr)
+	return arr
 }
 
 bubbleSort([-6, 20, 8, -2, 4])
 
-// Big O = O(n^2)
+// Big O = O(n^2)

src/bubbleSort.ts

@@ -1,5 +1,6 @@
-function cartesianProduct(arr1: number[], arr2: number[]) {
+function cartesianProduct(arr1: number[], arr2: number[]): string[] {
   const resultArr: string[] = []
+
   for (let i = 0; i < arr1.length; i++) {
     for (let j = 0; j < arr2.length; j++) {
       const item = `${arr1[i]}${arr2[j]}`
@@ -17,4 +18,4 @@ const arr2 = [3, 4, 5, 1, 0]
 
 cartesianProduct(arr1, arr2)
 
-// O(n1n2)
+// O(n1n2)

src/cartesianProduct.ts

@@ -1,15 +1,11 @@
 function climbingStair(n: number): number {
-  // n > >= 0
-  if (n <= 3) {
-    return n
-  }
+	const arr = [0, 1]
+	for (let i = 2; i < n; i++) {
+		arr[i] = arr[i - 2] + arr[i - 1]
+	}
 
-  return climbingStair(n - 2) + climbingStair(n - 1)
-
-  // or just using for loop.
+	return arr[n - 1]
 }
-console.log(climbingStair(4))
-
-// 4: 1111,121,112,211,22
+console.log(climbingStair(5))
 
-// O(n^3)
+// O(n)

src/climbingStair.ts

@@ -21,10 +21,13 @@ class HashTable {
     if (!bucket || !bucket.length) {
       bucket = [[key, value]]
     } else {
+      // find the same key
       const item = bucket.find(([itemKey]) => itemKey === key)
       if (item) {
+        // replace
         item[1] = value
       } else {
+        // add
         bucket.push([key, value])
       }
     }
@@ -53,12 +56,12 @@ class HashTable {
 }
 
 const hashTable = new HashTable()
-hashTable.set("name", "liao")
+hashTable.set('name', 'liao')
 
-console.log(hashTable.get("name"))
+console.log(hashTable.get('name'))
 
-hashTable.set("mane", "oho")
+hashTable.set('mane', 'oho')
 
-console.log(hashTable.get("mane"))
-console.log(hashTable.get("name"))
-console.log(hashTable.get("nae"))
+console.log(hashTable.get('mane'))
+console.log(hashTable.get('name'))
+console.log(hashTable.get('nae'))

src/hashTable.ts

@@ -1,17 +1,17 @@
-function insertionSort(arr: number[]) { 
+function insertionSort(arr: number[]) {
   for (let index = 1; index < arr.length; index++) {
     const numberToSort = arr[index]
-    
+
     for (let j = index - 1; j >= 0; j--) {
-        if(arr[j] > numberToSort) {
-          arr[j + 1] = arr[j]
-          if(j === 0) {
-            arr[j] = numberToSort
-          }
-        }else{
-          arr[j + 1] = numberToSort
-          break
+      if (arr[j] > numberToSort) {
+        arr[j + 1] = arr[j]
+        if (j === 0) {
+          arr[j] = numberToSort
         }
+      } else {
+        arr[j + 1] = numberToSort
+        break
+      }
     }
   }
   console.log(arr)
@@ -20,6 +20,6 @@ function insertionSort(arr: number[]) {
 
 // insertionSort([200,-500, -342,-234,-234,234,-234,5,-2,-55,-542,-5666,999, -1, 0, -2,-6, 20, 8,])
 
-insertionSort([-400,-300,99,100])
+insertionSort([99, -400, -300, 100])
 
-// O(n^2)
+// O(n^2)