# 318. Maximum Product of Word Lengths

73人阅读 评论(0)

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.

public class Solution {
public int maxProduct(String[] words) {
int len = words.length;
if(words==null || len <=0){
return 0;
}
int wordprocess[] = new int[len];
for(int i = 0; i < len; i++){

for(int j = 0; j < words[i].length(); j++){

wordprocess[i] |= 1 <<(words[i].charAt(j)-'a');
}
}
int maxProduct = 0;
for(int i = 0; i < len; i++){

for(int j = i+1; j < len; j++){

if(((wordprocess[i] & wordprocess[j]) == 0) && words[i].length()*words[j].length() > maxProduct){

maxProduct = words[i].length()*words[j].length();
}
}

}
return maxProduct;

}
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：123712次
• 积分：3936
• 等级：
• 排名：第8007名
• 原创：282篇
• 转载：7篇
• 译文：0篇
• 评论：8条
评论排行
最新评论