From 15120d307a5cdb999bebbfb04603bad032348a52 Mon Sep 17 00:00:00 2001
From: S-N-O-R-L-A-X <S-N-O-R-L-A-X@users.noreply.github.com>
Date: Sat, 10 Dec 2022 00:00:07 +0800
Subject: [PATCH] fix: fix names and move content to correct place

---
 .../chapter_stack_and_queue/array_stack.js    |   2 +-
 docs/chapter_stack_and_queue/stack.md         | 163 +++++++++---------
 2 files changed, 83 insertions(+), 82 deletions(-)

diff --git a/codes/javascript/chapter_stack_and_queue/array_stack.js b/codes/javascript/chapter_stack_and_queue/array_stack.js
index de748cb..a83d16f 100644
--- a/codes/javascript/chapter_stack_and_queue/array_stack.js
+++ b/codes/javascript/chapter_stack_and_queue/array_stack.js
@@ -1,5 +1,5 @@
 /**
- * File: array_stack.ts
+ * File: array_stack.js
  * Created Time: 2022-12-09
  * Author: S-N-O-R-L-A-X (snorlax.xu@outlook.com)
  */
diff --git a/docs/chapter_stack_and_queue/stack.md b/docs/chapter_stack_and_queue/stack.md
index 7eb79fb..d988bdf 100644
--- a/docs/chapter_stack_and_queue/stack.md
+++ b/docs/chapter_stack_and_queue/stack.md
@@ -397,92 +397,13 @@ comments: true
 === "JavaScript"
 
     ```js title="linkedlist_stack.js"
-    /* 基于数组实现的栈 */
-    class ArrayStack {
-        stack;
-        constructor() {
-            this.stack = [];
-        }
-        /* 获取栈的长度 */
-        get size() {
-            return this.stack.length;
-        }
-
-        /* 判断栈是否为空 */
-        empty() {
-            return this.stack.length === 0;
-        }
-
-        /* 入栈 */
-        push(num) {
-            this.stack.push(num);
-        }
-
-        /* 出栈 */
-        pop() {
-            return this.stack.pop();
-        }
-
-        /* 访问栈顶元素 */
-        top() {
-            return this.stack[this.stack.length - 1];
-        }
-
-        /* 访问索引 index 处元素 */
-        get(index) {
-            return this.stack[index];
-        }
-
-        /* 返回 Array */
-        toArray() {
-            return this.stack;
-        }
-    };
+    
     ```
 
 === "TypeScript"
 
     ```typescript title="linkedlist_stack.ts"
-    class ArrayStack {
-        private stack: number[];
-        constructor() {
-            this.stack = [];
-        }
-        /* 获取栈的长度 */
-        get size(): number {
-            return this.stack.length;
-        }
-
-        /* 判断栈是否为空 */
-        empty(): boolean {
-            return this.stack.length === 0;
-        }
-
-        /* 入栈 */
-        push(num: number): void {
-            this.stack.push(num);
-        }
-
-        /* 出栈 */
-        pop(): number | undefined {
-            return this.stack.pop();
-        }
-
-        /* 访问栈顶元素 */
-        top(): number | undefined {
-            return this.stack[this.stack.length - 1];
-        }
-
-        /* 访问索引 index 处元素 */
-        get(index: number): number | undefined {
-            return this.stack[index];
-        }
-
-        /* 返回 Array */
-        toArray() {
-            return this.stack;
-        }
-    };
+    
     ```
 
 === "C"
@@ -666,13 +587,93 @@ comments: true
 === "JavaScript"
 
     ```js title="array_stack.js"
+    /* 基于数组实现的栈 */
+    class ArrayStack {
+        stack;
+        constructor() {
+            this.stack = [];
+        }
+        /* 获取栈的长度 */
+        get size() {
+            return this.stack.length;
+        }
 
+        /* 判断栈是否为空 */
+        empty() {
+            return this.stack.length === 0;
+        }
+
+        /* 入栈 */
+        push(num) {
+            this.stack.push(num);
+        }
+
+        /* 出栈 */
+        pop() {
+            return this.stack.pop();
+        }
+
+        /* 访问栈顶元素 */
+        top() {
+            return this.stack[this.stack.length - 1];
+        }
+
+        /* 访问索引 index 处元素 */
+        get(index) {
+            return this.stack[index];
+        }
+
+        /* 返回 Array */
+        toArray() {
+            return this.stack;
+        }
+    };
     ```
 
 === "TypeScript"
 
     ```typescript title="array_stack.ts"
+    /* 基于数组实现的栈 */
+    class ArrayStack {
+        private stack: number[];
+        constructor() {
+            this.stack = [];
+        }
+        /* 获取栈的长度 */
+        get size(): number {
+            return this.stack.length;
+        }
 
+        /* 判断栈是否为空 */
+        empty(): boolean {
+            return this.stack.length === 0;
+        }
+
+        /* 入栈 */
+        push(num: number): void {
+            this.stack.push(num);
+        }
+
+        /* 出栈 */
+        pop(): number | undefined {
+            return this.stack.pop();
+        }
+
+        /* 访问栈顶元素 */
+        top(): number | undefined {
+            return this.stack[this.stack.length - 1];
+        }
+
+        /* 访问索引 index 处元素 */
+        get(index: number): number | undefined {
+            return this.stack[index];
+        }
+
+        /* 返回 Array */
+        toArray() {
+            return this.stack;
+        }
+    };
     ```
 
 === "C"