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.

一开始还是先写了一个暴力解法...运行超时之后，意识到要找更加简便的算法来求解。

bool check(string str1, string str2){
	for(int i = 0; i < str1.length(); i++)
		for(int j = 0; j < str2.length(); j++)
			if(str1[i]==str2[j]) return false;
	return true;
}
class Solution {
public:
    int maxProduct(vector<string>& words) {
        int ans = 0;

        for(int i = 0; i < words.size(); i++)
        	for(int j = i+1; j < words.size(); j++)
        		if(check(words[i],word[j])&&words[i].length()*words[j].length()>ans)
        			ans = words[i].length()*words[j].length();	
        			
		return ans;
	}
};

这一次还是偷偷点开了show tags，看到Bit Manipulation的标签。想了一下发现，可以用一个26位的二进制数来表示每一个单词中字母出现的情况。将表示两个单词的26位二进制数进行与运算，结果为0说明两个单词没有重复的字母。

class Solution {
public:
    int maxProduct(vector<string>& words) {
        int ans = 0;
        vector<int> count(words.size());
        for(int i = 0; i < words.size(); i++){
        	for(int j = 0; j < words[i].length(); j++){
        		int x = (count[i]>>(words[i][j]-'a'));
        		if((x&1)==0) count[i]+=(1<<(words[i][j]-'a'));
			}
		}

        for(int i = 0; i < words.size(); i++)
        	for(int j = i+1; j < words.size(); j++)
        		if(((count[i]&count[j])==0)&&words[i].length()*words[j].length()>ans)
        			ans = words[i].length()*words[j].length();	
        			
		return ans;
	}
};

利用位操作能使一些问题的求解大大简化，这一点也是我之前总是忽略的- -