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/cpp/chapter_stack_and_queue/array_queue.cpp

@@ -48,7 +48,7 @@ class ArrayQueue {
             return;
         }
         // 计算队尾指针，指向队尾索引 + 1
-        // 通过取余操作，实现 rear 越过数组尾部后回到头部
+        // 通过取余操作实现 rear 越过数组尾部后回到头部
         int rear = (front + queSize) % queCapacity;
         // 将 num 添加至队尾
         nums[rear] = num;
@@ -58,7 +58,7 @@ class ArrayQueue {
     /* 出队 */
     int pop() {
         int num = peek();
-        // 队首指针向后移动一位，若越过尾部则返回到数组头部
+        // 队首指针向后移动一位，若越过尾部，则返回到数组头部
         front = (front + 1) % queCapacity;
         queSize--;
         return num;