class Solution {
public:
int maxProduct(vector<string>& words) {
if(words.size()==0)
return 0;
int len=words.size();
vector<int> wordschar(len,0);
for(int i=0;i<len;i++)
{
string tmp=words[i];
wordschar[i]=0;
for(int j=0;j<tmp.size();j++)
{
wordschar[i]|=(1<<(tmp[j]-'a'));
}
}
int maxp=0;
for(int i=0;i<len;i++)
for(int j=0;j<len;j++)
{
if((wordschar[i]&wordschar[j])==0&&(words[i].size()*words[j].size()>maxp))
{
maxp=words[i].size()*words[j].size();
}
}
return maxp;
}
};
318. Maximum Product of Word Lengths
最新推荐文章于 2022-09-19 19:48:13 发布