[LeetCode 318] 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:

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

Example 2:

Input: ["a","ab","abc","d","cd","bcd","abcd"]
Output: 4 
Explanation: The two words can be "ab", "cd".

Example 3:

Input: ["a","aa","aaa","aaaa"]
Output: 0 
Explanation: No such pair of words.

分析

这一题可以使用暴力搜索的办法，分别遍历两两之间是否有重复的char，如果没有的话，就更新长度乘积的最大值。但是如何判断两个word是否有相同的char，这个可以想到使用cha[26]数组的方式，但是这样的话复杂度和空间复杂度分别是 n^2 * 26，26*n。

考虑到本题中只有小写的字母，其实使用int的位即可代表char是否出现，这样的话就可以利用int的&操作判断两个word是否存在相同的char。大大的降低了运行时间

运行效率

class Solution {
public:
    int maxProduct(vector<string>& words) {
        int length = words.size();
        if (length == 0)
            return 0;
        
        int res = 0;
        vector<int> word(length, 0);
        for (int i = 0; i < length; i ++)
        {
            for (int j = 0; j < words[i].size(); j ++)
            {
                char c = words[i][j];
                word[i] |= (1 << (c-'a'));
            }
        }
        
        for (int i = 0; i < length-1; i ++)
        {
            for (int j = i+1; j < length; j ++)
            {
                if ((word[i] & word[j]) == 0)
                {
                    res = max(res, int(words[i].size()) * int(words[j].size()));
                }
                
            }
        }
        return res;
    }
};

运行效率

Runtime: 48 ms, faster than 96.90% of C++ online submissions for Maximum Product of Word Lengths.

Memory Usage: 13 MB, less than 100.00% of C++ online submissions forMaximum Product of Word Lengths.