Middle-题目9：318. Maximum Product of Word Lengths

Middle-题目9：318. Maximum Product of Word Lengths

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.

public class Solution {
public int maxProduct(String[] words) {
int maxPdc=0;
int[] letters=new int[words.length];
for(int i=0;i<words.length;i++)
for(int j=0;j<words[i].length();j++)
letters[i]=letters[i]|1<<(words[i].charAt(j)-'a');
for(int i=0;i<words.length;i++) {
for(int j=i+1;j<words.length;j++) {
if((letters[i]&letters[j]) == 0) {
int tempPdc=words[i].length()*words[j].length();
if(tempPdc>maxPdc)
maxPdc=tempPdc;
}
}
}
return maxPdc;
}
}

37ms,beats 63.38%,众数39ms,6.29%.
Cmershen的碎碎念：
letters[i]=letters[i]|1<<(words[i].charAt(j)-‘a’);这行代码起初写成了Math.pow(2,…)结果提交后成绩为100ms，可见移位比幂运算的速度快很多。

06-03 469

01-12 3713

07-14 701

12-16 1229

02-22 253

01-19 151

06-13 1944

03-05 189

07-18 126

03-29 340