318. Maximum Product of Word Lengths

原创 2016年08月29日 22:33:15

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.

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

简单分析一下这个问题。找出一个字符串数组中,任意两个字符串长度乘积的最大值,并且这两个字符串没有任何共同的相同字母。如果只是要求找到乘积的最大值,似乎只要两层循环O(n*n)就好了。假如我们有办法知道两个字符串是否有相同字母(true or false),这个问题就变得很简单啦。那如何去处理要求两个字符串没有任何相同字母呢?如果每次都要两层循环去比较两个字符串的每个字母,那代价就相当大了,会变成O(n*n) * O(n*n)。

其实,因为每个字母都是小写字母,所以我们可以用一个int的26位去保存每个单词所包含的字母的信息:因为我们不关心每个单词中各个字母出现的个数,只关心是否出现,所以可以用1表示出现,0表示未出现。这样的好处是,经过这样的预处理之后,当需要判断两个单词是否有相同字母时,做个与计算就知道结果了(是否为0)。这样,我们就得到了O(n*n)的解法。

单片机的位操作,囧。

public class Solution {
    public int maxProduct(String[] words) {
        int len = words.length;
        if(words==null || len <=0){
            return 0;
        }
        int wordprocess[] = new int[len];
        for(int i = 0; i < len; i++){

            for(int j = 0; j < words[i].length(); j++){

                wordprocess[i] |= 1 <<(words[i].charAt(j)-'a');
            }
        }
        int maxProduct = 0;
        for(int i = 0; i < len; i++){

            for(int j = i+1; j < len; j++){

                if(((wordprocess[i] & wordprocess[j]) == 0) && words[i].length()*words[j].length() > maxProduct){

                    maxProduct = words[i].length()*words[j].length();
                }
            }

        }
        return maxProduct;

    }
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

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 ...

LeetCode 318. Maximum Product of Word Lengths 题解(C++)

Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the tw...

leetcode_middle_24_318. Maximum Product of Word Lengths

题意:给一个字符串数组,返回最大的两个字符串长度的乘积。其中这两个字符串不能有相同的字母 分析: public class Solution { public int maxProduct(S...

【leetcode】318. Maximum Product of Word Lengths

一、题目描述 Given a string array words, find the maximum value of length(word[i]) * length(word[j]...

[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 t...

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 tw...

Leetcode 318. Maximum Product of Word Lengths

-题目- Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where ...

leetcode318:Maximum Product of Word Lengths(medium)

题目:Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where t...

LeetCode 318. Maximum Product of Word Lengths(最大单词长度乘积)

原题网址:https://leetcode.com/problems/maximum-product-of-word-lengths/ Given a string array words, fi...

318. Maximum Product of Word Lengths

Difficulty:Medium Given a string array words, find the maximum value of length(word[i]) *...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)