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.

参考http://blog.csdn.net/sjt19910311/article/details/51225362

一个int型整数有32位，但是小写字母一共只有26个，所以我们可以使用一个整数的低26位来表示一个字符串中都含有哪些字母。从低位到高位，如果该位是1，表示该字符串中有该字母，否则表示没有该子母。

	public int maxProduct(String[] words) {
		int len = words.length;
		int[] bitWords = new int[len];
		for (int i = 0; i < len; i++)
			for (int j = 0; j < words[i].length(); j++)
				bitWords[i] |= 1 << (words[i].charAt(j) - 'a');
		int max = 0;
		for (int i = 0; i < len; i++)
			for (int j = i + 1; j < len; j++)
				if ((bitWords[i] & bitWords[j]) == 0)
					max = Math.max(words[i].length() * words[j].length(), max);
		return max;
	}