給定一個字符串數組 words,找到 length(word[i]) * length(word[j]) 的最大值,並且這兩個單詞不含有公共字母。你可以認爲每個單詞只包含小寫字母。如果不存在這樣的兩個單詞,返回 0。
示例 1:
輸入: ["abcw","baz","foo","bar","xtfn","abcdef"]
輸出: 16
解釋: 這兩個單詞爲 "abcw", "xtfn"。
示例 2:
輸入: ["a","ab","abc","d","cd","bcd","abcd"]
輸出: 4
解釋: 這兩個單詞爲 "ab", "cd"。
示例 3:
輸入: ["a","aa","aaa","aaaa"]
輸出: 0
解釋: 不存在這樣的兩個單詞。
來源:力扣(LeetCode)
鏈接:https://leetcode-cn.com/problems/maximum-product-of-word-lengths
著作權歸領釦網絡所有。商業轉載請聯繫官方授權,非商業轉載請註明出處。
class Solution {
public:
int str2int(string &str){
int res =0;
for(auto c:str){
res |= 1<<(c-'a');
}
return res;
}
int maxProduct(vector<string>& words) {
vector<int> vec;
for(int i=0;i<words.size();i++){
vec.push_back(str2int(words[i]));
int temp = str2int(words[i]);
cout<<words[i]<<" "<<temp<<endl;
}
int res=0;
for(int i=0;i<words.size();i++){
for(int j=i+1;j<words.size();j++){
if((vec[i]&vec[j])==0&&(words[i].size()*words[j].size()>res)){
res = words[i].size()*words[j].size();
}
}
}
return res;
}
};