LeetCode 318 -Maximum Product of Word Lengths ( JAVA )

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 result = 0;
    int [] bitChar = new int[words.length];
    for(int i = 0 ; i<words.length ; i++){
        int tmp = 0;
        for(int j=0 ; j<words[i].length() ; j++){
            tmp |= 1 << (words[i].charAt(j) -'a');
        }
        bitChar[i] = tmp;
    }
    for(int i = 0 ; i<words.length ; i++){
        for(int j = i+1 ; j<words.length ; j++){
            if((bitChar[i] & bitChar[j]) == 0 && words[i].length()*words[j].length() > result){
                result = words[i].length()*words[j].length();
            }
        }
    }
    return result;
    }
}

总结：题目要求，求一个字符串数组里面，两个字符串乘积A*B最大，并且要求，A和B 没有相同的字符串。博主陷入懵逼（类似题做的太少没啥经验）。看提示给的是位运算。想半天没想出来， 看看大神的代码吧，解释一下本题的解法，一共26位字符，可以运用2进制来分别表示26个字母，在一个32位的int中，没1位代表一个字符，还是足够的，相当于1代表a，10代表b，100代表c，1000代表d；每一个字符串通过charAt（）取字符，再与tmp进行或运算，得出结果插入 bitChar[i]中，比如， 字符串abc，得出结果为111，为7；之后再2次循环遍历即可。