LeetCode 318. 最大单词长度乘积

给定一个字符串数组 words，找到 length(word[i]) * length(word[j]) 的最大值，并且这两个单词不含有公共字母。你可以认为每个单词只包含小写字母。如果不存在这样的两个单词，返回 0。

示例 1:

输入: ["abcw","baz","foo","bar","xtfn","abcdef"]
输出: 16 
解释: 这两个单词为 "abcw", "xtfn"。
示例 2:

输入: ["a","ab","abc","d","cd","bcd","abcd"]
输出: 4 
解释: 这两个单词为 "ab", "cd"。
示例 3:

输入: ["a","aa","aaa","aaaa"]
输出: 0 
解释: 不存在这样的两个单词。

 

class Solution {
public:
    int maxProduct(vector<string>& words) {
        if (words.empty())
            return 0;

        int n = words.size();
        int codes[n];
        for (int i = 0; i < n; ++i)
        {
            int code = 0;
            for (auto c: words[i])
                code |= (1 << (c - 'a'));
            codes[i] = code;
        }

        size_t max_len = 0;
        for (int i = 0; i < n - 1; ++i)
        {
            for (int j = 1; j < n; ++j)
            {
                if ((codes[i] & codes[j]) == 0)
                    max_len = max(max_len, words[i].size() * words[j].size());
            }
        }
        return max_len;
    }
};