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.

解题思路：

使用位操作。对于每一个字符串，使用一个int型整数保存字符串的每一个字母是否出现过（int型整数32位，足够保存26个字母的信息）。

AC代码如下：

class Solution {
public:
	int maxProduct(vector<string>& words) {
		if (words.size() == 0) return 0;
		vector<string> words_new;
		vector<unsigned int> dicts;
		for (int i = 0; i < words.size(); ++i){
			unsigned int dict = 0;
			for (int j = 0; j < words[i].size(); ++j){
				int offset = words[i][j] - 'a';
				dict = dict | 0x1 << offset;
			}
			words_new.push_back(words[i]);
			dicts.push_back(dict);
		}

		int n = words_new.size();
		int ans = 0;
		for (int i = 0; i < n - 1; ++i){
			for (int j = i + 1; j < n; ++j){
				if (!(dicts[i] & dicts[j])) {
					int product = words_new[i].size()*words_new[j].size();
					ans = max(ans, product);
				}
			}
		}
		return ans;
	}
};