feat: add swift implementation to lcp problem: No.66

lcp/LCP 66. 最小展台数量/README.md

@@ -151,6 +151,29 @@ func minNumBooths(demand []string) (ans int) {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func minNumBooths(_ demand: [String]) -> Int {
+        var maxBooths = [Int](repeating: 0, count: 26)
+
+        for day in demand {
+            var dailyCount = [Int](repeating: 0, count: 26)
+            for char in day {
+                let index = Int(char.asciiValue! - Character("a").asciiValue!)
+                dailyCount[index] += 1
+            }
+            for i in 0..<26 {
+                maxBooths[i] = max(maxBooths[i], dailyCount[i])
+            }
+        }
+
+        return maxBooths.reduce(0, +)
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcp/LCP 66. 最小展台数量/Solution.swift

@@ -0,0 +1,18 @@
+class Solution {
+    func minNumBooths(_ demand: [String]) -> Int {
+        var maxBooths = [Int](repeating: 0, count: 26)
+
+        for day in demand {
+            var dailyCount = [Int](repeating: 0, count: 26)
+            for char in day {
+                let index = Int(char.asciiValue! - Character("a").asciiValue!)
+                dailyCount[index] += 1
+            }
+            for i in 0..<26 {
+                maxBooths[i] = max(maxBooths[i], dailyCount[i])
+            }
+        }
+
+        return maxBooths.reduce(0, +)
+    }
+}