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

lcp/LCP 12. 小张刷题计划/README.md

@@ -217,6 +217,44 @@ function minTime(time: number[], m: number): number {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func minTime(_ time: [Int], _ m: Int) -> Int {
+        var left = 0
+        var right = time.reduce(0, +)
+
+        while left < right {
+            let mid = (left + right) / 2
+            if check(mid, time, m) {
+                right = mid
+            } else {
+                left = mid + 1
+            }
+        }
+        return left
+    }
+
+    private func check(_ t: Int, _ time: [Int], _ m: Int) -> Bool {
+        var sum = 0
+        var maxTime = 0
+        var days = 1
+
+        for x in time {
+            sum += x
+            maxTime = max(maxTime, x)
+            if sum - maxTime > t {
+                sum = x
+                maxTime = x
+                days += 1
+            }
+        }
+        return days <= m
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcp/LCP 12. 小张刷题计划/Solution.swift

@@ -0,0 +1,33 @@
+class Solution {
+    func minTime(_ time: [Int], _ m: Int) -> Int {
+        var left = 0
+        var right = time.reduce(0, +)
+
+        while left < right {
+            let mid = (left + right) / 2
+            if check(mid, time, m) {
+                right = mid
+            } else {
+                left = mid + 1
+            }
+        }
+        return left
+    }
+
+    private func check(_ t: Int, _ time: [Int], _ m: Int) -> Bool {
+        var sum = 0
+        var maxTime = 0
+        var days = 1
+
+        for x in time {
+            sum += x
+            maxTime = max(maxTime, x)
+            if sum - maxTime > t {
+                sum = x
+                maxTime = x
+                days += 1
+            }
+        }
+        return days <= m
+    }
+}