Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case letters. If no such two words exist, return 0.

Example 1:

Input: ["abcw","baz","foo","bar","xtfn","abcdef"]
 

Output: 16 
Explanation: The two words can be "abcw", "xtfn".

Example 2:

Input: ["a","ab","abc","d","cd","bcd","abcd"]
Output: 4 
Explanation: The two words can be "ab", "cd".

Example 3:

Input: ["a","aa","aaa","aaaa"]
Output: 0 
Explanation: No such pair of words.

給定一個字符串數組 words，找到 length(word[i]) * length(word[j])

示例 1:

輸入: ["abcw","baz","foo","bar","xtfn","abcdef"]
輸出: 16 
解釋: 這兩個單詞為 "abcw", "xtfn"。

示例 2:

輸入: ["a","ab","abc","d","cd","bcd","abcd"]
輸出: 4 
解釋: 這兩個單詞為 "ab", "cd"。

示例 3:

輸入: ["a","aa","aaa","aaaa"]
輸出: 0 
解釋: 不存在這樣的兩個單詞。

332 ms
 

 1 class Solution {    
 2     func maxProduct(_ words: [String]) -> Int {
 3         if words.isEmpty {
 4             return 0
 5         }
 6         
 7         let products = words.map{ProductHelper($0)}
 8         
 9         var res = 0
10         
11         for i in 0..<products.count {
12             for j in i+1..<products.count {
13                 let p1 = products[i]
14                 let p2 = products[j]
15                 if p1.characters & p2.characters == 0 {
16                     res = max(p1.count * p2.count, res)
17                 }
18             }
19         }
20         
21         return res
22     }
23 }
24 
25 class ProductHelper {
26     let count : Int
27     let characters : Int
28     init(_ s : String) {
29         count = s.count
30         let arr = s.unicodeScalars
31         var r = 0
32         for c in arr {
33             r |= 1 << Int(c.value - 97) 
34         }
35         characters = r
36     }
37 }

804ms

 1 class Solution {
 2     func maxProduct(_ words: [String]) -> Int {
 3         let aValue = "a".unicodeScalars.first!.value
 4         if words.count <= 1 { return 0 }
 5         var array = [Int]()
 6         for word in words {
 7             var a = 0
 8             for c in word.unicodeScalars {
 9                 a = a | (1 << (c.value - aValue))
10             }
11             array.append(a)
12         }
13         
14         var result = 0
15         for i in 0 ..< array.count - 1 {
16             for j in 1 ..< array.count {
17                 if array[i] & array[j] > 0 {
18                     continue
19                 }
20                 result = max(result, words[i].count * words[j].count)
21             }
22         }
23         return result
24     }    
25 }

[Swift]LeetCode318. 最大單詞長度乘積 | Maximum Product of Word Lengths