318. Maximum Product of Word Lengths

题目链接：https://leetcode.com/problems/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) {
        if(words.length==0 || words==null) 
            return 0;
        
        int len = words.length;
        int[] value = new int[words.length];
        
        for(int i=0;i<len;i++) {
            value[i] = 0;
            String word = words[i];
            for(int j=0;j<word.length();j++) {
                value[i] |= 1<<(word.charAt(j) - 'a');
            }
        }
        
        int maxProduct = 0;
        
        for(int i=0;i<len;i++) {
            for(int j=i+1;j<len;j++) {
                if((value[i] & value[j]) == 0 && (words[i].length() * words[j].length() > maxProduct)) {
                    maxProduct = words[i].length() * words[j].length();
                }
            }
        }
        
        return maxProduct;
    }
}

最后的大小比较也可以实现：

1. if((mask[i] & mask[j]) == 0) {  
2.                     max = Math.max(max, words[i].length() * words[j].length());  
3.                 }