LeetCode: 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.

思路：关键在于怎么判断两个单词是否有相同的字母，第一印象是为每个单词设置一个set，然后遍历，想想这样应该会超时，于是直接看答案，结果是使用位操作。
我们知道一个int用32位二进制来表示，而小写字母的种类总数为26种。因此我们可以用一个int的低26位来表示一个word是否含有某个字符，比如int的32位为00000…0001，则说明含有字符‘a’，00000…0010，表示含有字符‘b’，这样在判断两个单词是否含有相同的字符时，只需要将对应的32位二进制进行按位与操作。程序代码如下：

    public int maxProduct(String[] words) {
        int res = 0;

        if(words==null || words.length==0){
            return res;
        }

        int[] bitRepresent = new int[words.length]; //用二进制位表示一个单词含有那些字符

        for(int i=0;i<words.length;i++){
            int temp = 0;

            for(int j=0;j<words[i].length();j++){
                temp |= 1<<(words[i].charAt(j)-'a');
            }

            bitRepresent[i] = temp;
        }

        for(int i=0;i<bitRepresent.length;i++){
            for(int j=i+1;j<bitRepresent.length;j++){
                if((bitRepresent[i] & bitRepresent[j])==0 && words[i].length()* words[j].length()>res){
                    res = words[i].length()* words[j].length();
                }
            }
        }

        return res;
    }