feat: add swift implementation to lcof2 problem: No.035 (doocs#3040)

Author: klever34

lcof2/剑指 Offer II 035. 最小时间差/README.md

@@ -167,6 +167,35 @@ function findMinDifference(timePoints: string[]): number {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func findMinDifference(_ timePoints: [String]) -> Int {
+        if timePoints.count > 24 * 60 {
+            return 0
+        }
+        
+        var mins = [Int]()
+        
+        for t in timePoints {
+            let time = t.split(separator: ":").map { Int($0)! }
+            mins.append(time[0] * 60 + time[1])
+        }
+        
+        mins.sort()
+        mins.append(mins[0] + 24 * 60)
+        
+        var ans = Int.max
+        for i in 1..<mins.count {
+            ans = min(ans, mins[i] - mins[i - 1])
+        }
+        
+        return ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof2/剑指 Offer II 035. 最小时间差/Solution.swift

@@ -0,0 +1,24 @@
+class Solution {
+    func findMinDifference(_ timePoints: [String]) -> Int {
+        if timePoints.count > 24 * 60 {
+            return 0
+        }
+        
+        var mins = [Int]()
+        
+        for t in timePoints {
+            let time = t.split(separator: ":").map { Int($0)! }
+            mins.append(time[0] * 60 + time[1])
+        }
+        
+        mins.sort()
+        mins.append(mins[0] + 24 * 60)
+        
+        var ans = Int.max
+        for i in 1..<mins.count {
+            ans = min(ans, mins[i] - mins[i - 1])
+        }
+        
+        return ans
+    }
+}