题目
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.
解1 (超时)
public int maxProduct(String[] words) {
int len=words.length;
int ret=0;
for(int i=0;i<len-1;i++){
for(int j=i+1;j<len;j++){
if(isAllDiff(words[i],words[j])){
char[] aArr=words[i].toCharArray();
char[] bArr=words[j].toCharArray();
if(aArr.length*bArr.length>ret)
{
ret=aArr.length*bArr.length;
}
}
}
}
return ret;
}
public boolean isAllDiff(String a,String b){
char[] aArr=a.toCharArray();
char[] bArr=b.toCharArray();
ArrayList<String> aL=new ArrayList<String>();
for(int i=0;i<aArr.length;i++){
aL.add(String.valueOf(aArr[i]));
}
ArrayList<String> bL=new ArrayList<String>();
for(int j=0;j<bArr.length;j++){
bL.add(String.valueOf(bArr[j]));
}
for(int k=0;k<aL.size();k++){
if(bL.contains(aL.get(k))){
return false;
}
}
return true;
}
解2
思路:关键在于怎么判断两个单词是否有相同的字母,第一印象是为每个单词设置一个set,然后遍历,想想这样应该会超时,于是直接看答案,结果是使用位操作。
我们知道一个int用32位二进制来表示,而小写字母的种类总数为26种。因此我们可以用一个int的低26位来表示一个word是否含有某个字符,比如int的32位为00000…0001,则说明含有字符‘a’,00000…0010,表示含有字符‘b’,这样在判断两个单词是否含有相同的字符时,只需要将对应的32位二进制进行按位与操作。
public int maxProduct(String[] words) {
int ret=0;
int[] mask=new int[words.length];
for(int i=0;i<words.length;i++){
for(int j=0;j<words[i].length();j++){
mask[i]|=1<<(words[i].charAt(j)-'a');
}
}
for(int i=0;i<words.length-1;i++){
for(int j=i+1;j<words.length;j++){
if((mask[i] & mask[j])==0)
{
ret=Math.max(ret, words[i].length()*words[j].length());
}
}
}
return ret;
}
相关链接地址
参考链接1:http://blog.csdn.net/sbitswc/article/details/50505035
参考链接2:http://www.lai18.com/content/2536510.html