位运算记录字母是否出现过,然后枚举值
class Solution {
public:
int maxProduct(vector<string>& words) {
int visit[1005] = {0};
for (int i = 0; i < words.size(); i++) {
for (string::iterator it = words[i].begin(); it != words[i].end(); ++it)
visit[i] |= 1 << (*it - 'a');
}
int ans = 0;
for (int i = 0; i < words.size(); ++i)
for (int j = i + 1; j < words.size(); ++j)
if (!(visit[i] & visit[j]))
ans = max(ans, (int)(words[i].size() * words[j].size()));
return ans;
}
};