Maximum Product of Word Lengths

最大单词长度乘积算法

最新推荐文章于 2025-09-11 19:19:55 发布

原创最新推荐文章于 2025-09-11 19:19:55 发布 · 80 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #python

leetcode 专栏收录该内容

232 篇文章

订阅专栏

本文探讨了如何在不共享相同字母的两单词间找到其长度的最大乘积。通过使用Python实现的解决方案，我们遍历字符串数组，检查每对单词是否具有共同字母，并计算符合条件的单词长度乘积，最终返回最大值。

Maximum Product of Word Lengths

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

Input: [“abcw”,“baz”,“foo”,“bar”,“xtfn”,“abcdef”]
Output: 16
Explanation: The two words can be “abcw”, “xtfn”.

Solution

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