Given a string array words
, find the maximum value of length(word[i]) * length(word[j])
where the two words do not share common letters. You may assume that each word will contain only lower case letters. If no such two words exist, return 0.
Example 1:
Given ["abcw", "baz", "foo", "bar", "xtfn", "abcdef"]
Return 16
The two words can be "abcw", "xtfn"
.
Example 2:
Given ["a", "ab", "abc", "d", "cd", "bcd", "abcd"]
Return 4
The two words can be "ab", "cd"
.
Example 3:
Given ["a", "aa", "aaa", "aaaa"]
Return 0
No such pair of words.
这题关键在于如何快速求解两个word是否含有相同的字符。
我们可以用一个32位int型,表示每个字母是否存在。
比如第一位表示字符串中a是否春在,那么第一位置1表示a存在。第二位置1,表示b存在,类似。
那么对两个字符串,可以把他们对应的int类型做与,如果结果不是零,表示某一位都是1,有重复数字,这样就利用bit操作优化复杂度。
class Solution {
public:
int maxProduct(vector<string>& words) {
int len = words.size();
vector<int> BitMap(len,0);
int result = 0;
for(int i=0; i<len; ++i){
for(int k=0; k<words[i].size(); ++k){
BitMap[i] |= 0x01 << (words[i][k]-'a'); //把对应位置1
}
for(int j=0; j<i; ++j){
if (!(BitMap[i] & BitMap[j])) //做与判断是否存在相同字符
result = max(result, int(words[i].size() * words[j].size()));
}
}
return result;
}
};