leetcode [318] 最大单词长度乘积

---

Contact me:

Blog -> https://cugtyt.github.io/blog/index
Email -> cugtyt@qq.com
GitHub -> Cugtyt@GitHub

---

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

class Solution:
    def maxProduct(self, words: List[str]) -> int:
        def no_common(a, b):
            a, b = set(a), set(b)
            return not a & b


        if len(words) == 0: return 0
        words.sort(key=lambda x: -len(x))
        ans = 0
        for i in range(len(words)):
            for j in range(i + 1, len(words)):
                if no_common(words[i], words[j]):
                    ans = max(ans, len(words[i]) * len(words[j]))
        return ans