[Swift]LeetCode318. 最大单词长度乘积 | Maximum Product of Word Lengths

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/10260623.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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:

["abcw","baz","foo","bar","xtfn","abcdef"]
16 
Explanation: 
"abcw", "xtfn"

Example 2:

["a","ab","abc","d","cd","bcd","abcd"]
4 
Explanation: 
"ab", "cd"

Example 3:

["a","aa","aaa","aaaa"]
0 
Explanation: 

---

给定一个字符串数组 words，找到 length(word[i]) * length(word[j]) 的最大值，并且这两个单词不含有公共字母。你可以认为每个单词只包含小写字母。如果不存在这样的两个单词，返回 0。

示例 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

class Solution {    
    func maxProduct(_ words: [String]) -> Int {
        if words.isEmpty {
            return 0
        }
        
        let products = words.map{ProductHelper($0)}
        
        var res = 0
        
        for i in 0..<products.count {
            for j in i+1..<products.count {
                let p1 = products[i]
                let p2 = products[j]
                if p1.characters & p2.characters == 0 {
                    res = max(p1.count * p2.count, res)
                }
            }
        }
        
        return res
    }
}

class ProductHelper {
    let count : Int
    let characters : Int
    init(_ s : String) {
        count = s.count
        let arr = s.unicodeScalars
        var r = 0
        for c in arr {
            r |= 1 << Int(c.value - 97) 
        }
        characters = r
    }
}

---

804ms

class Solution {
    func maxProduct(_ words: [String]) -> Int {
        let aValue = "a".unicodeScalars.first!.value
        if words.count <= 1 { return 0 }
        var array = [Int]()
        for word in words {
            var a = 0
            for c in word.unicodeScalars {
                a = a | (1 << (c.value - aValue))
            }
            array.append(a)
        }
        
        var result = 0
        for i in 0 ..< array.count - 1 {
            for j in 1 ..< array.count {
                if array[i] & array[j] > 0 {
                    continue
                }
                result = max(result, words[i].count * words[j].count)
            }
        }
        return result
    }    
}