leetcode 318. Maximum Product of Word Lengths

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