# 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.

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;

}
}

#### 318. Maximum Product of Word Lengths（重点！）

2016-07-14 21:20:46

#### leetcode318-Maximum Product of Word Lengths

2016-06-03 19:23:25

#### [LeetCode 318] Maximum Product of Word Lengths

2016-01-12 16:25:17

#### Leetcode: Maximum Product of Word Lengths

2015-12-16 20:02:50

#### 318. Maximum Product of Word Lengths**

2017-01-19 21:09:18

#### [LeetCode]318. Maximum Product of Word Lengths

2016-03-05 10:33:21

#### <LeetCode OJ> 318. Maximum Product of Word Lengths

2016-06-13 20:31:51

#### 【LeetCode】318. Maximum Product of Word Lengths

2016-07-18 15:41:31

#### Leetcode ☞ 318. Maximum Product of Word Lengths ☆

2016-02-28 20:37:39

#### [leetcode] 318. Maximum Product of Word Lengths 解题报告

2016-03-29 15:21:50