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:

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.

思路：关键在于如何判断两个字符串是否有重复的字符，这里引用bit进行标记，即mask

代码1：

class Solution {
public:
    bool help(string a,string b){
        for(char ch:a){
            if(b.find(ch)!=string::npos){return false;}
        }
        return true;
    }
    
    static bool compare(string a, string b){
        return a.size()>b.size();
    }
    int maxProduct(vector<string>& words) {
        if(words.size()==0){return 0;}
        sort(words.begin(),words.end(),compare);
        int max=0;
        for(int i=0;i<words.size()-1;i++){
            for(int j=i+1;j<words.size();j++){
                if(help(words[i],words[j])){
                    if(max<words[i].size()*words[j].size()){
                        max=words[i].size()*words[j].size();
                    }
                    
                    break;
                }
            }
        }
        return max;
    }
};

代码2/3：

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