LeetCode-Python-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 
解释: 不存在这样的两个单词。

思路：

暴力求解，先把输入按单词长度排好序，越长的单词在越前面。用counter统计每个单词里字母出现的次数。

然后双重循环配对单词，如果满足不存在重复元素的条件就刷新res。

class Solution(object):
    def maxProduct(self, words):
        """
        :type words: List[str]
        :rtype: int
        """
        words = sorted(words, key = lambda x: -len(x))
        # print words
        from collections import Counter
        dic = [Counter(item) for item in words]
        # print dic
        res = 0
        l = len(words)
        for i in range(l - 1):
            for j in range(i + 1, l):
                flag = 0
                for char in words[i]:
                    if char in dic[j]:
                        flag = 1
                        break
                if flag == 0:
                    res = max(res,  len(words[i]) *len(words[j]))
        return res