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

Analysis:

The soultion is calcuated by doing a product of the length of
each string to every other string. Anyhow the constraint given is
that the two strings should not have any common character. This
is taken care by creating a unique number for every string. Image
a an 32 bit integer where 0 bit corresponds to 'a', 1st bit
corresponds to 'b' and so on.
	 * 
Thus if two strings contain the same character when we do and
"AND" the result will not be zero and we can ignore that case.

Solution:

public class Solution {
    public int maxProduct(String[] words) {
        if (words.length==0) return 0;

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

        int res = 0;
        for (int i=0;i<words.length;i++)
            for (int j=0;j<words.length;j++)
                if ((masks[i] & masks[j]) ==0){
                    res = Math.max(res,words[i].length()*words[j].length());
                }

        return res;
    }
}