feat: add swift implementation to lcof problem: No.66 (#2961)

Author: klever34

lcof/面试题66. 构建乘积数组/README.md

@@ -188,6 +188,33 @@ public class Solution {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func constructArr(_ a: [Int]) -> [Int] {
+        let n = a.count
+        guard n > 0 else { return [] }
+        
+        var ans = [Int](repeating: 1, count: n)
+        
+        var left = 1
+        for i in 0..<n {
+            ans[i] = left
+            left *= a[i]
+        }
+        
+        var right = 1
+        for i in (0..<n).reversed() {
+            ans[i] *= right
+            right *= a[i]
+        }
+        
+        return ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof/面试题66. 构建乘积数组/Solution.swift

@@ -0,0 +1,22 @@
+class Solution {
+    func constructArr(_ a: [Int]) -> [Int] {
+        let n = a.count
+        guard n > 0 else { return [] }
+        
+        var ans = [Int](repeating: 1, count: n)
+        
+        var left = 1
+        for i in 0..<n {
+            ans[i] = left
+            left *= a[i]
+        }
+        
+        var right = 1
+        for i in (0..<n).reversed() {
+            ans[i] *= right
+            right *= a[i]
+        }
+        
+        return ans
+    }
+}