leetcode: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 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.

Subscribe to see which companies asked this question

class Solution {
public:
    int maxProduct(vector<string>& words) {
        
        vector<int> auxVtr(words.size());
        int maxLen = 0;
        
        for (int i=0; i<words.size(); i++)
        {
            string curStr = words[i];
            for (int j=0; j<curStr.size(); j++)
            {
                auxVtr[i] = auxVtr[i] | (1 << (curStr[j]-'a'));
            }
        }
        
        for (int i=0; i<words.size(); i++)
        {
            int len1 = words[i].size();
            for (int j=i+1; j<words.size(); j++)
            {
                if ((auxVtr[i] & auxVtr[j]) == 0)
                {
                    int len2 = words[j].size();
                    maxLen = max(maxLen, len1*len2);
                }
            }
        }
        
        return maxLen;
    }
};