2023每日刷题(二十一)
Leetcode—318.最大单词长度乘积
位运算思想实现代码
class Solution {
public:
int maxProduct(vector<string>& words) {
int wordsLen = words.size();
vector<int> mask(wordsLen);
for(int i = 0; i < wordsLen; i++) {
int wordLen = words[i].size();
string s = words[i];
mask[i] = 0;
for(int j = 0; j < wordLen; j++) {
mask[i] |= 1 << (s[j] - 'a');
}
}
int maxPro = 0;
for(int i = 0; i < wordsLen - 1; i++) {
int maskL = mask[i];
for(int j = i + 1; j < wordsLen; j++) {
int maskR = mask[j];
if((maskL & maskR) == 0) {
int lenL = words[i].size();
int lenR = words[j].size();
maxPro = maxPro > lenL * lenR ? maxPro: lenL * lenR;
}
}
}
return maxPro;
}
};
运行结果
之后我会持续更新,如果喜欢我的文章,请记得一键三连哦,点赞关注收藏,你的每一个赞每一份关注每一次收藏都将是我前进路上的无限动力 !!!↖(▔▽▔)↗感谢支持!