# LeetCode 318 Maximum Product of Word Lengths (位压缩)

326人阅读 评论(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 size = words.length;
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 ++) {
ans = Math.max(ans, len[i] * len[j]);
}
}
}
return ans;
}
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：569831次
• 积分：13437
• 等级：
• 排名：第955名
• 原创：800篇
• 转载：7篇
• 译文：0篇
• 评论：119条
博客专栏
 LeetCode 文章：126篇 阅读：53305
 Java学习笔记 文章：10篇 阅读：5701
 算法题 文章：47篇 阅读：23870
阅读排行