class Solution {
public:
int arr[1005] = { 0 };
int maxProduct(vector<string>& wo) {
for (int i = 0; i < wo.size(); i++) {
for (int l = 0; l < wo[i].size(); l++) {
arr[i] = arr[i] | 1 << (wo[i][l] - 97);
if (arr[i] == (1 << 26) - 1) break;
}
}
int ans = 0;
for (int i = 0; i < wo.size() - 1; i++) {
for (int j = i + 1; j < wo.size(); j++) {
if (!(arr[i] & arr[j])) {
ans = max(ans, (int)wo[i].size() * (int)wo[j].size());
}
}
}
return ans;
}
};
318. 最大单词长度乘积
最新推荐文章于 2024-09-07 16:56:49 发布