feat: add swift implementation to lcof2 problem: No.101

lcof2/剑指 Offer II 101. 分割等和子串/README.md

@@ -156,6 +156,28 @@ func canPartition(nums []int) bool {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func canPartition(_ nums: [Int]) -> Bool {
+        let s = nums.reduce(0, +)
+        if s % 2 != 0 { return false }
+        let target = s / 2
+        var dp = Array(repeating: false, count: target + 1)
+        dp[0] = true
+
+        for num in nums {
+            for j in stride(from: target, through: num, by: -1) {
+                dp[j] = dp[j] || dp[j - num]
+            }
+        }
+
+        return dp[target]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof2/剑指 Offer II 101. 分割等和子串/Solution.swift

@@ -0,0 +1,17 @@
+class Solution {
+    func canPartition(_ nums: [Int]) -> Bool {
+        let s = nums.reduce(0, +)
+        if s % 2 != 0 { return false }
+        let target = s / 2
+        var dp = Array(repeating: false, count: target + 1)
+        dp[0] = true
+
+        for num in nums {
+            for j in stride(from: target, through: num, by: -1) {
+                dp[j] = dp[j] || dp[j - num]
+            }
+        }
+
+        return dp[target]
+    }
+}