From ac1a56c1a91b7e82266949e1e3d2af37744eef38 Mon Sep 17 00:00:00 2001
From: Lanre Adedara <lanre.adedara@shara.co>
Date: Fri, 31 May 2024 07:27:57 +0100
Subject: [PATCH] Swift implementation for LCOF2 005

---
 .../README.md"                                | 28 +++++++++++++++++++
 .../Solution.swift"                           | 23 +++++++++++++++
 2 files changed, 51 insertions(+)
 create mode 100644 "lcof2/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257/Solution.swift"

diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257/README.md"
index 02217ef72fa10..c60e6fb8c031e 100644
--- "a/lcof2/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257/README.md"	
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257/README.md"	
@@ -181,6 +181,34 @@ function maxProduct(words: string[]): number {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func maxProduct(_ words: [String]) -> Int {
+        let n = words.count
+        var masks = [Int](repeating: 0, count: n)
+        
+        for i in 0..<n {
+            for c in words[i] {
+                masks[i] |= 1 << (c.asciiValue! - Character("a").asciiValue!)
+            }
+        }
+        
+        var maxProduct = 0
+        for i in 0..<n {
+            for j in i+1..<n {
+                if masks[i] & masks[j] == 0 {
+                    maxProduct = max(maxProduct, words[i].count * words[j].count)
+                }
+            }
+        }
+        
+        return maxProduct
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257/Solution.swift" "b/lcof2/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257/Solution.swift"
new file mode 100644
index 0000000000000..89768c17f6765
--- /dev/null
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 005. \345\215\225\350\257\215\351\225\277\345\272\246\347\232\204\346\234\200\345\244\247\344\271\230\347\247\257/Solution.swift"	
@@ -0,0 +1,23 @@
+class Solution {
+    func maxProduct(_ words: [String]) -> Int {
+        let n = words.count
+        var masks = [Int](repeating: 0, count: n)
+        
+        for i in 0..<n {
+            for c in words[i] {
+                masks[i] |= 1 << (c.asciiValue! - Character("a").asciiValue!)
+            }
+        }
+        
+        var maxProduct = 0
+        for i in 0..<n {
+            for j in i+1..<n {
+                if masks[i] & masks[j] == 0 {
+                    maxProduct = max(maxProduct, words[i].count * words[j].count)
+                }
+            }
+        }
+        
+        return maxProduct
+    }
+}
\ No newline at end of file