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.
Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.
题目分析:对每个字符串含有字母的状态用二进制压缩,相与为0则表示这个两个字符串不含相同字母
public class Solution {
public int maxProduct(String[] words) {
int size = words.length;
int[] bitMask = new int[size];
int[] len = new int[size];
for(int i = 0; i < size; i ++) {
len[i] = words[i].length();
for(int j = 0; j < len[i]; j ++) {
bitMask[i] |= 1 << (words[i].charAt(j) - 'a');
}
}
int ans = 0;
for(int i = 0; i < size; i ++) {
for(int j = i + 1; j < size; j ++) {
if((bitMask[i] & bitMask[j]) == 0) {
ans = Math.max(ans, len[i] * len[j]);
}
}
}
return ans;
}
}