build

chapter_stack_and_queue/deque.md

@@ -142,7 +142,7 @@ comments: true
     isEmpty := deque.Len() == 0
     ```
 
-=== "JavaScript"
+=== "JS"
 
     ```javascript title="deque.js"
     /* 初始化双向队列 */
@@ -180,7 +180,7 @@ comments: true
     console.log("双向队列是否为空 = " + isEmpty);
     ```
 
-=== "TypeScript"
+=== "TS"
 
     ```typescript title="deque.ts"
     /* 初始化双向队列 */
@@ -814,7 +814,7 @@ comments: true
     }
     ```
 
-=== "JavaScript"
+=== "JS"
 
     ```javascript title="linkedlist_deque.js"
     /* 双向链表节点 */
@@ -941,7 +941,7 @@ comments: true
     }
     ```
 
-=== "TypeScript"
+=== "TS"
 
     ```typescript title="linkedlist_deque.ts"
     /* 双向链表节点 */
@@ -2413,7 +2413,7 @@ comments: true
     }
     ```
 
-=== "JavaScript"
+=== "JS"
 
     ```javascript title="array_deque.js"
     /* 基于环形数组实现的双向队列 */
@@ -2521,7 +2521,7 @@ comments: true
     }
     ```
 
-=== "TypeScript"
+=== "TS"
 
     ```typescript title="array_deque.ts"
     /* 基于环形数组实现的双向队列 */

chapter_stack_and_queue/queue.md

@@ -136,7 +136,7 @@ comments: true
     isEmpty := queue.Len() == 0
     ```
 
-=== "JavaScript"
+=== "JS"
 
     ```javascript title="queue.js"
     /* 初始化队列 */
@@ -164,7 +164,7 @@ comments: true
     const empty = queue.length === 0;
     ```
 
-=== "TypeScript"
+=== "TS"
 
     ```typescript title="queue.ts"
     /* 初始化队列 */
@@ -572,7 +572,7 @@ comments: true
     }
     ```
 
-=== "JavaScript"
+=== "JS"
 
     ```javascript title="linkedlist_queue.js"
     /* 基于链表实现的队列 */
@@ -640,7 +640,7 @@ comments: true
     }
     ```
 
-=== "TypeScript"
+=== "TS"
 
     ```typescript title="linkedlist_queue.ts"
     /* 基于链表实现的队列 */
@@ -1486,7 +1486,7 @@ comments: true
     }
     ```
 
-=== "JavaScript"
+=== "JS"
 
     ```javascript title="array_queue.js"
     /* 基于环形数组实现的队列 */
@@ -1555,7 +1555,7 @@ comments: true
     }
     ```
 
-=== "TypeScript"
+=== "TS"
 
     ```typescript title="array_queue.ts"
     /* 基于环形数组实现的队列 */

chapter_stack_and_queue/stack.md

@@ -137,7 +137,7 @@ comments: true
     isEmpty := len(stack) == 0
     ```
 
-=== "JavaScript"
+=== "JS"
 
     ```javascript title="stack.js"
     /* 初始化栈 */
@@ -164,7 +164,7 @@ comments: true
     const is_empty = stack.length === 0;
     ```
 
-=== "TypeScript"
+=== "TS"
 
     ```typescript title="stack.ts"
     /* 初始化栈 */
@@ -545,7 +545,7 @@ comments: true
     }
     ```
 
-=== "JavaScript"
+=== "JS"
 
     ```javascript title="linkedlist_stack.js"
     /* 基于链表实现的栈 */
@@ -602,7 +602,7 @@ comments: true
     }
     ```
 
-=== "TypeScript"
+=== "TS"
 
     ```typescript title="linkedlist_stack.ts"
     /* 基于链表实现的栈 */
@@ -1264,7 +1264,7 @@ comments: true
     }
     ```
 
-=== "JavaScript"
+=== "JS"
 
     ```javascript title="array_stack.js"
     /* 基于数组实现的栈 */
@@ -1308,7 +1308,7 @@ comments: true
     }
     ```
 
-=== "TypeScript"
+=== "TS"
 
     ```typescript title="array_stack.ts"
     /* 基于数组实现的栈 */