C++ | Leetcode C++题解之第318题最大单词长度乘积
题目：
题解：
class Solution {
public:int maxProduct(vector<string>& words) {unordered_map<int,int> map;int length = words.size();for (int i = 0; i < length; i++) {int mask = 0;string word = words[i];int wordLength = word.size();for (int j = 0; j < wordLength; j++) {mask |= 1 << (word[j] - 'a');}if(map.count(mask)) {if (wordLength > map[mask]) {map[mask] = wordLength;}} else {map[mask] = wordLength;}}int maxProd = 0;for (auto [mask1, _] : map) {int wordLength1 = map[mask1];for (auto [mask2, _] : map) {if ((mask1 & mask2) == 0) {int wordLength2 = map[mask2];maxProd = max(maxProd, wordLength1 * wordLength2);}}}return maxProd;}
};