LeetCode 318. Maximum Product of Word Lengths（位运算）

318. Maximum Product of Word Lengths

Medium

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:

Input: [“abcw”,“baz”,“foo”,“bar”,“xtfn”,“abcdef”]
Output: 16
Explanation: The two words can be “abcw”, “xtfn”.
Example 2:

Input: [“a”,“ab”,“abc”,“d”,“cd”,“bcd”,“abcd”]
Output: 4
Explanation: The two words can be “ab”, “cd”.
Example 3:

Input: [“a”,“aa”,“aaa”,“aaaa”]
Output: 0
Explanation: No such pair of words.

题意

给定一个字符串数组，求两个没有公共字符的字符串的长度乘积的最大值

思路

难点在于判断两个字符串是否有公共字符。一种取巧的方法是把’a’ - 'z’这26个字符看作一个正整数的第0-25位，如果字符串有第i个字符，则字符串对应的正整数在第i位为1， 否则为0，判断两个字符串是否有公共字符转化为判断两个字符串对应的两个正整数相与是否为0

代码

class Solution {
    public int maxProduct(String[] words) {
        int n = words.length;
        if (n <= 1) {
            return 0;
        }
        int[] digits = new int[n];
        for (int i=0; i<n; ++i) {
            for (char ch: words[i].toCharArray()) {
                digits[i] |= 1 << (ch - 'a');
            }
        }
        int maxp = 0;
        for (int i=0; i<n-1; ++i) {
            for (int j=i+1; j<n; ++j) {
                if ((digits[i] & digits[j]) ==0) {
                    maxp = Math.max(maxp, words[i].length() * words[j].length());
                }
            }
        }
        return maxp;
    }
}