Feature/chapter greedy swift (#720)

* feat: add Swift codes for greedy_algorithm article

* feat: add Swift codes for fractional_knapsack_problem article

* feat: add Swift codes for max_capacity_problem article

* feat: add Swift codes for max_product_cutting_problem article

codes/swift/chapter_greedy/max_capacity.swift

@@ -0,0 +1,38 @@
+/**
+ * File: max_capacity.swift
+ * Created Time: 2023-09-03
+ * Author: nuomi1 (nuomi1@qq.com)
+ */
+
+/* 最大容量：贪心 */
+func maxCapacity(ht: [Int]) -> Int {
+    // 初始化 i, j 分列数组两端
+    var i = 0, j = ht.count - 1
+    // 初始最大容量为 0
+    var res = 0
+    // 循环贪心选择，直至两板相遇
+    while i < j {
+        // 更新最大容量
+        let cap = min(ht[i], ht[j]) * (j - i)
+        res = max(res, cap)
+        // 向内移动短板
+        if ht[i] < ht[j] {
+            i += 1
+        } else {
+            j -= 1
+        }
+    }
+    return res
+}
+
+@main
+enum MaxCapacity {
+    /* Driver Code */
+    static func main() {
+        let ht = [3, 8, 5, 2, 7, 7, 3, 4]
+
+        // 贪心算法
+        let res = maxCapacity(ht: ht)
+        print("最大容量为 \(res)")
+    }
+}