深夜瞎琢磨

关注

318. Maximum Product of Word Lengths刷题笔记

深夜瞎琢磨

关注

阅读 27

2023-05-26


用的题解

class Solution:
    def maxProduct(self, words: List[str]) -> int:
        d = {}
        for w in words:
            mask = 0
            for c in set(w):
                mask |= (1 << (ord(c) - 97))
            d[mask] = max(d.get(mask, 0), len(w))
        return max([d[x] * d[y] for x in d for y in d if not x & y] or [0])

318. Maximum Product of Word Lengths刷题笔记_算法


相关推荐

_铁马冰河_

318. Maximum Product of Word Lengths

_铁马冰河_ 27 0 0

hwwjian

LeetCode-318. Maximum Product of Word Lengths

hwwjian 94 0 0

小月亮06

318. 最大单词长度乘积

小月亮06 20 0 0

孟祥忠诗歌

LeetCode 318. 最大单词长度乘积

孟祥忠诗歌 36 0 0

言诗把酒

UVA-Maximum Product

言诗把酒 29 0 0

嚯霍嚯

318. 最大单词长度乘积 : 经典「状态压缩 + 位运算」入门题

嚯霍嚯 36 0 0

幺幺零

LeetCode 152 Maximum Product Subarray

幺幺零 85 0 0

灵魂跑者

leetcode -- Maximum Product Subarray -- 重点

灵魂跑者 32 0 0

棒锤_45f2

152. Maximum Product Subarray

棒锤_45f2 29 0 0

书呆鱼

[leetcode] 152. Maximum Product Subarray

书呆鱼 17 0 0

精彩评论(0)

0 0 举报