Review Swift codes (#1150)

* feat(swift): review for chapter_computational_complexity

* feat(swift): review for chapter_data_structure

* feat(swift): review for chapter_array_and_linkedlist

* feat(swift): review for chapter_stack_and_queue

* feat(swift): review for chapter_hashing

* feat(swift): review for chapter_tree

* feat(swift): add codes for heap article

* feat(swift): review for chapter_heap

* feat(swift): review for chapter_graph

* feat(swift): review for chapter_searching

* feat(swift): review for chapter_sorting

* feat(swift): review for chapter_divide_and_conquer

* feat(swift): review for chapter_backtracking

* feat(swift): review for chapter_dynamic_programming

* feat(swift): review for chapter_greedy

* feat(swift): review for utils

* feat(swift): update ci tool

* feat(swift): trailing closure

* feat(swift): array init

* feat(swift): map index

codes/swift/chapter_stack_and_queue/array_queue.swift

@@ -7,12 +7,14 @@
 /* 基于环形数组实现的队列 */
 class ArrayQueue {
     private var nums: [Int] // 用于存储队列元素的数组
-    private var front = 0 // 队首指针，指向队首元素
-    private var queSize = 0 // 队列长度
+    private var front: Int // 队首指针，指向队首元素
+    private var _size: Int // 队列长度
 
     init(capacity: Int) {
         // 初始化数组
         nums = Array(repeating: 0, count: capacity)
+        front = 0
+        _size = 0
     }
 
     /* 获取队列的容量 */
@@ -22,12 +24,12 @@ class ArrayQueue {
 
     /* 获取队列的长度 */
     func size() -> Int {
-        queSize
+        _size
     }
 
     /* 判断队列是否为空 */
     func isEmpty() -> Bool {
-        queSize == 0
+        size() == 0
     }
 
     /* 入队 */
@@ -38,10 +40,10 @@ class ArrayQueue {
         }
         // 计算队尾指针，指向队尾索引 + 1
         // 通过取余操作实现 rear 越过数组尾部后回到头部
-        let rear = (front + queSize) % capacity()
+        let rear = (front + size()) % capacity()
         // 将 num 添加至队尾
         nums[rear] = num
-        queSize += 1
+        _size += 1
     }
 
     /* 出队 */
@@ -50,7 +52,7 @@ class ArrayQueue {
         let num = peek()
         // 队首指针向后移动一位，若越过尾部，则返回到数组头部
         front = (front + 1) % capacity()
-        queSize -= 1
+        _size -= 1
         return num
     }
 
@@ -65,11 +67,7 @@ class ArrayQueue {
     /* 返回数组 */
     func toArray() -> [Int] {
         // 仅转换有效长度范围内的列表元素
-        var res = Array(repeating: 0, count: queSize)
-        for (i, j) in sequence(first: (0, front), next: { $0 < self.queSize - 1 ? ($0 + 1, $1 + 1) : nil }) {
-            res[i] = nums[j % capacity()]
-        }
-        return res
+        (front ..< front + size()).map { nums[$0 % capacity()] }
     }
 }