3.18 最大单词长度——力扣

318. 最大单词长度乘积

已解答

中等

相关标签

相关企业

给你一个字符串数组 words ，找出并返回 length(words[i]) * length(words[j]) 的最大值，并且这两个单词不含有公共字母。如果不存在这样的两个单词，返回 0 。

示例 1：

输入：words = ["abcw","baz","foo","bar","xtfn","abcdef"]
输出：16 
解释：这两个单词为 "abcw", "xtfn"。

示例 2：

输入：words = ["a","ab","abc","d","cd","bcd","abcd"]
输出：4 
解释：这两个单词为 "ab", "cd"。

示例 3：

输入：words = ["a","aa","aaa","aaaa"]
输出：0 
解释：不存在这样的两个单词。

提示：

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

python

class Solution(object):
    def maxProduct(self, words):
        """
        :type words: List[str]
        :rtype: int
        """
        lists = {}
        for i in words:
            lists[i] = [len(i), set(list(i))]
        ans = 0
        lens = len(words)
        for i in range(lens):
            si=lists[words[i]]
            for j in range(i + 1, lens):
                sj=lists[words[j]]
                if not si[1].intersection(sj[1]) and si[0] * sj[0] > ans:
                    ans = si[0] * sj[0]
        return ans