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_divide_and_conquer/binary_search_recur.swift

@@ -26,9 +26,8 @@ func dfs(nums: [Int], target: Int, i: Int, j: Int) -> Int {
 
 /* 二分查找 */
 func binarySearch(nums: [Int], target: Int) -> Int {
-    let n = nums.count
     // 求解问题 f(0, n-1)
-    return dfs(nums: nums, target: target, i: 0, j: n - 1)
+    dfs(nums: nums, target: target, i: nums.startIndex, j: nums.endIndex - 1)
 }
 
 @main

codes/swift/chapter_divide_and_conquer/build_tree.swift

@@ -28,7 +28,7 @@ func dfs(preorder: [Int], inorderMap: [Int: Int], i: Int, l: Int, r: Int) -> Tre
 func buildTree(preorder: [Int], inorder: [Int]) -> TreeNode? {
     // 初始化哈希表，存储 inorder 元素到索引的映射
     let inorderMap = inorder.enumerated().reduce(into: [:]) { $0[$1.element] = $1.offset }
-    return dfs(preorder: preorder, inorderMap: inorderMap, i: 0, l: 0, r: inorder.count - 1)
+    return dfs(preorder: preorder, inorderMap: inorderMap, i: inorder.startIndex, l: inorder.startIndex, r: inorder.endIndex - 1)
 }
 
 @main