feat: add swift implementation to lcof2 problem: No.011 (doocs#2981)

klever34 · web-flow · commit 21520c178867 · 2024-05-31T16:58:05.000+08:00
diff --git a/lcof2/剑指 Offer II 011. 0 和 1 个数相同的子数组/README.md b/lcof2/剑指 Offer II 011. 0 和 1 个数相同的子数组/README.md
@@ -161,6 +161,29 @@ function findMaxLength(nums: number[]): number {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func findMaxLength(_ nums: [Int]) -> Int {
+        var d: [Int: Int] = [0: -1]
+        var ans = 0
+        var s = 0
+        
+        for i in 0..<nums.count {
+            s += nums[i] == 0 ? -1 : 1
+            if let prevIndex = d[s] {
+                ans = max(ans, i - prevIndex)
+            } else {
+                d[s] = i
+            }
+        }
+        
+        return ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git a/lcof2/剑指 Offer II 011. 0 和 1 个数相同的子数组/Solution.swift b/lcof2/剑指 Offer II 011. 0 和 1 个数相同的子数组/Solution.swift
@@ -0,0 +1,18 @@
+class Solution {
+    func findMaxLength(_ nums: [Int]) -> Int {
+        var d: [Int: Int] = [0: -1]
+        var ans = 0
+        var s = 0
+        
+        for i in 0..<nums.count {
+            s += nums[i] == 0 ? -1 : 1
+            if let prevIndex = d[s] {
+                ans = max(ans, i - prevIndex)
+            } else {
+                d[s] = i
+            }
+        }
+        
+        return ans
+    }
+}
