Update the book based on the revised second edition (#1014)

* Revised the book

* Update the book with the second revised edition

* Revise base on the manuscript of the first edition

codes/javascript/chapter_stack_and_queue/array_queue.js

@@ -35,8 +35,8 @@ class ArrayQueue {
             console.log('队列已满');
             return;
         }
-        // 计算尾指针，指向队尾索引 + 1
-        // 通过取余操作，实现 rear 越过数组尾部后回到头部
+        // 计算队尾指针，指向队尾索引 + 1
+        // 通过取余操作实现 rear 越过数组尾部后回到头部
         const rear = (this.#front + this.size) % this.capacity;
         // 将 num 添加至队尾
         this.#nums[rear] = num;
@@ -46,7 +46,7 @@ class ArrayQueue {
     /* 出队 */
     pop() {
         const num = this.peek();
-        // 队首指针向后移动一位，若越过尾部则返回到数组头部
+        // 队首指针向后移动一位，若越过尾部，则返回到数组头部
         this.#front = (this.#front + 1) % this.capacity;
         this.#queSize--;
         return num;