318. Maximum Product of Word Lengths

public class Solution {
    public int maxProduct(String[] words) {
        int max = 0 ;
        int[] masks = new int[words.length];
        for (int i = 0; i < masks.length; i++) {
			for (char c : words[i].toCharArray()) {
				masks[i] = (masks[i])|(1<<((int)(c-'a')));
			}
		}
        System.out.println(Arrays.toString(masks));
        for (int i = 0; i < masks.length; i++) {
			for (int j = i+1; j < masks.length; j++) {
				if (((masks[i]&masks[j])==0)&&(words[i].length()*words[j].length()>max)) {
					max = words[i].length()*words[j].length();
				}
			}
		}
        return max;
    }
}