feat: add swift implementation to lcof2 problem: No.095 (doocs#3481)

Author: klever34

lcof2/剑指 Offer II 095. 最长公共子序列/README.md

@@ -275,6 +275,30 @@ class Solution {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func longestCommonSubsequence(_ text1: String, _ text2: String) -> Int {
+        let m = text1.count, n = text2.count
+        let text1Array = Array(text1)
+        let text2Array = Array(text2)
+        var f = Array(repeating: Array(repeating: 0, count: n + 1), count: m + 1)
+
+        for i in 1...m {
+            for j in 1...n {
+                if text1Array[i - 1] == text2Array[j - 1] {
+                    f[i][j] = f[i - 1][j - 1] + 1
+                } else {
+                    f[i][j] = max(f[i - 1][j], f[i][j - 1])
+                }
+            }
+        }
+        return f[m][n]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof2/剑指 Offer II 095. 最长公共子序列/Solution.swift

@@ -0,0 +1,19 @@
+class Solution {
+    func longestCommonSubsequence(_ text1: String, _ text2: String) -> Int {
+        let m = text1.count, n = text2.count
+        let text1Array = Array(text1)
+        let text2Array = Array(text2)
+        var f = Array(repeating: Array(repeating: 0, count: n + 1), count: m + 1)
+        
+        for i in 1...m {
+            for j in 1...n {
+                if text1Array[i - 1] == text2Array[j - 1] {
+                    f[i][j] = f[i - 1][j - 1] + 1
+                } else {
+                    f[i][j] = max(f[i - 1][j], f[i][j - 1])
+                }
+            }
+        }
+        return f[m][n]
+    }
+}