📝 docs: update READMEs

Author: guanghechen

Diff for: packages/circular-queue/README.md

@@ -73,6 +73,13 @@ are kept in the queue. Other operations are the same as ordinary queues.
   yarn add @algorithm.ts/circular-queue
   ```
 
+* deno
+
+  ```typescript
+  import { createCircularQueue } from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/circular-queue/src/index.ts'
+  ```
+
+
 ## Usage
 
 * Basic:

Diff for: packages/dijkstra/README.md

@@ -74,6 +74,12 @@ The following definition is quoted from Wikipedia (https://en.wikipedia.org/wiki
   yarn add @algorithm.ts/dijkstra
   ```
 
+* deno
+
+  ```typescript
+  import dijkstra from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/dijkstra/src/index.ts'
+  ```
+
 ## Usage
 
 A solution for leetcode "Number of Ways to Arrive at Destination"

Diff for: packages/dlx/README.md

@@ -72,6 +72,12 @@ If you are interested in this algorithm, you can check [here][dlx].
   yarn add @algorithm.ts/dlx
   ```
 
+* deno
+
+  ```typescript
+  import { createDLX } from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/dlx/src/index.ts'
+  ```
+
 ## Usage
 
 * Use dlx to solve a 9x9 sudoku problem:

Diff for: packages/knuth-shuffle/README.md

@@ -72,6 +72,12 @@ If you are interested in this algorithm, you can check [here][knuth-shuffle].
   yarn add @algorithm.ts/knuth-shuffle
   ```
 
+* deno
+
+  ```typescript
+  import knuthShuffle from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/knuth-shuffle/src/index.ts'
+  ```
+
 ## Usage
 
 * Shuffle nums.

Diff for: packages/lower-bound/README.md

@@ -69,6 +69,13 @@ greater or equals than the target element.
   yarn add @algorithm.ts/lower-bound
   ```
 
+* deno
+
+  ```typescript
+  import lowerBound from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/lower-bound/src/index.ts'
+  ```
+
+
 ## Usage
 
 * Basic

Diff for: packages/priority-queue/README.md

@@ -74,7 +74,7 @@ complexity of the enqueue and dequeue operations are both $O(\log N)$.
 
 * deno
 
-  ```bash
+  ```typescript
   import { createPriorityQueue } from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/priority-queue/src/index.ts'
   ```
 

Diff for: packages/sliding-window/README.md

@@ -69,7 +69,7 @@ A typescript implementation of the **sliding-window** algorithm.
 
 * deno
 
-  ```bash
+  ```typescript
   import { createSlidingWindow } from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/sliding-window/src/index.ts'
   ```
 

Diff for: packages/trie/README.md

@@ -79,7 +79,7 @@ The following definition is quoted from Wikipedia (https://en.wikipedia.org/wiki
 
 * deno
 
-  ```bash
+  ```typescript
   import { createTrie } from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/trie/src/index.ts'
   ```
 

Diff for: packages/upper-bound/README.md

@@ -69,6 +69,12 @@ greater than the target element.
   yarn add @algorithm.ts/upper-bound
   ```
 
+* deno
+
+  ```typescript
+  import upperBound from 'https://raw.githubusercontent.com/guanghechen/algorithm.ts/main/packages/upper-bound/src/index.ts'
+  ```
+
 ## Usage
 
 * Basic