LeetCode 318 Maximum Product of Word Lengths (位压缩)

原创 2016年08月30日 16:12:46

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.


题目链接:https://leetcode.com/problems/maximum-product-of-word-lengths/

题目分析:对每个字符串含有字母的状态用二进制压缩,相与为0则表示这个两个字符串不含相同字母
public class Solution {
    public int maxProduct(String[] words) {
        int size = words.length;
        int[] bitMask = new int[size];
        int[] len = new int[size];
        for(int i = 0; i < size; i ++) {
            len[i] = words[i].length();
            for(int j = 0; j < len[i]; j ++) {
                bitMask[i] |= 1 << (words[i].charAt(j) - 'a');
            }
        }
        int ans = 0;
        for(int i = 0; i < size; i ++) {
            for(int j = i + 1; j < size; j ++) {
                if((bitMask[i] & bitMask[j]) == 0) {
                    ans = Math.max(ans, len[i] * len[j]);
                }
            }
        }
        return ans;
    }
}


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

LeetCode P318 Maximum Product of Word Lengths

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

LeetCode 318. Maximum Product of Word Lengths解题记录

1. 题目描述https://leetcode.com/problems/maximum-product-of-word-lengths/#/description Given a string ...

【Leetcode】318. Maximum Product of Word Lengths

方法一:(空间复杂度O(1),时间复杂度O(n^2)) 很简单的多次遍历的方式: public int maxProduct(String[] words) {         int res  = ...

<LeetCode OJ> 318. Maximum Product of Word Lengths

Total Accepted: 23617 Total Submissions: 58995 Difficulty: Medium Given a string array words, f...

leetcode 318. Maximum Product of Word Lengths-最长单词积|位运算

原题链接:318. Maximum Product of Word Lengths 【思路-Java、Python】 本题的妙处在于用一个 int 值就能表示26个字母,哪些字母在单词中出现过,哪些字...

leetcode_318. Maximum Product of Word Lengths 求两个不相交的字符串的长度乘积的最大值,将字母转换成二进制形式,按位与比较是否有相同字母

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

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...
  • pusude
  • pusude
  • 2017年02月07日 11:02
  • 80

【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 (位压缩)
举报原因:
原因补充:

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