318. 最大单词长度乘积

给定一个字符串数组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
解释: 不存在这样的两个单词。

提示：

• 2 <= words.length <= 1000
• 1 <= words[i].length <= 1000
• words[i]仅包含小写字母

1.遍历
Python解答：

class Solution:
    def maxProduct(self, words: List[str]) -> int:
        map = [set(item) for item in words]
        def check(map, i, j):
            return not (map[i] & map[j])
        max_value = 0
        for i in range(len(words)):
            for j in range(i+1, len(words)):
                if check(map, i, j):
                    max_value = max(max_value, len(words[i])*len(words[j]))
        return max_value