Today's Challenge

https://leetcode.com/problems/maximum-product-of-word-lengths/

Maximum Product of Word Lengths - LeetCode

n이 그렇게 크지 않아서, 그냥 문제가 원하는대로 풀면 됨.

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