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

@@ -35,8 +35,8 @@ class ArrayQueue {
     if (_queSize == capaCity()) {
       throw Exception("队列已满");
     }
-    // 计算尾指针，指向队尾索引 + 1
-    // 通过取余操作，实现 rear 越过数组尾部后回到头部
+    // 计算队尾指针，指向队尾索引 + 1
+    // 通过取余操作实现 rear 越过数组尾部后回到头部
     int rear = (_front + _queSize) % capaCity();
     // 将 _num 添加至队尾
     _nums[rear] = _num;
@@ -46,7 +46,7 @@ class ArrayQueue {
   /* 出队 */
   int pop() {
     int _num = peek();
-    // 队首指针向后移动一位，若越过尾部则返回到数组头部
+    // 队首指针向后移动一位，若越过尾部，则返回到数组头部
     _front = (_front + 1) % capaCity();
     _queSize--;
     return _num;