Middle-题目9:318. Maximum Product of Word Lengths

原创 2016年05月31日 15:29:36

Middle-题目9: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.
题目大意:
给一个字符串数组,字符串都是由小写字母组成的。求出两字符没有交集的字符串的长度的最大积。若不存在没有交集的字符串,则返回0.
题目分析:
对每一个字符串进行编码,编码成一个26位的比特串,其中比特串的第i位代表字符串中有第i个字母。这样得到一个编码数组,再O(n2)暴力扫描编码数组,如果存在两个编码按位或的值为0,说明这两个编码对应的字符串没有交集,这样更新一次长度乘积的最大值。
源码:(language:java)

public class Solution {
    public int maxProduct(String[] words) {
        int maxPdc=0;
        int[] letters=new int[words.length];
        for(int i=0;i<words.length;i++)
            for(int j=0;j<words[i].length();j++)
                letters[i]=letters[i]|1<<(words[i].charAt(j)-'a');
        for(int i=0;i<words.length;i++) {
            for(int j=i+1;j<words.length;j++) {
                if((letters[i]&letters[j]) == 0) {
                    int tempPdc=words[i].length()*words[j].length();
                    if(tempPdc>maxPdc)
                        maxPdc=tempPdc;
                }
            }
        }
        return maxPdc;            
    }
}

成绩:
37ms,beats 63.38%,众数39ms,6.29%.
Cmershen的碎碎念:
letters[i]=letters[i]|1<<(words[i].charAt(j)-‘a’);这行代码起初写成了Math.pow(2,…)结果提交后成绩为100ms,可见移位比幂运算的速度快很多。

版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs

相关文章推荐

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]) 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】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个字)