Leetcode: Maximum Product of Word Lengths

Question

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 1:
Given [“abcw”, “baz”, “foo”, “bar”, “xtfn”, “abcdef”]
Return 16
The two words can be “abcw”, “xtfn”.

Example 2:
Given [“a”, “ab”, “abc”, “d”, “cd”, “bcd”, “abcd”]
Return 4
The two words can be “ab”, “cd”.

Example 3:
Given [“a”, “aa”, “aaa”, “aaaa”]
Return 0
No such pair of words.

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

Hide Company Tags Google
Hide Tags Bit Manipulation

---

Solution

Get idea from here.

class Solution(object):
    def maxProduct(self, words):
        """
        :type words: List[str]
        :rtype: int
        """

        nums = [0]*len(words)
        for ind,w in enumerate(words):
            for i in range(len(w)):
                nums[ind] |= 1<<(ord(w[i])-ord('a'))

        res = 0
        for x in range(len(words)):
            for y in range(x, len(words)):
                if (nums[x]&nums[y])==0:
                    res = max( res, len(words[x])*len(words[y]) )

        return res