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.

Follow up:

Could you do better than O(n2), where n is the number of words?

转自我的新博客： 细语呢喃 > leetcode Maximum Product of Word Lengths

其实因为全部都是小写的字母，用int 就可以存储每一位的信息。这就是位运算

• elements[i] |= 1 << (words[i][j] – ‘a’);   //把words[i][j] 在26字母中的出现的次序变为1
•  elements[i] & elements[j]    // 判断是否有交集只需要两个数 按位 与 （AND）运算即可

class Solution {
public:
	int maxProduct(vector<string>& words) {
		int n = words.size();
		vector<int> elements(n, 0);
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < words[i].length(); j++)
				elements[i] |= 1 << (words[i][j] - 'a');
		}
		int ans = 0;
		for (int i = 0; i < n; i++) {
			for (int j = i + 1; j < n; j++) {
				if (!(elements[i] & elements[j]) && words[i].length() * words[j].length()  > ans)
					ans = words[i].length() * words[j].length();
			}
		}
		return ans;
	}
};

本博客若无特殊说明则由 hrwhisper 原创发布
转载请点名出处：细语呢喃 > leetcode Maximum Product of Word Lengths
本文地址：http://www.hrwhisper.me/leetcode-maximum-product-of-word-lengths/