其他分享
首页 > 其他分享> > [LeetCode]Maximum Product of Word Lengths

[LeetCode]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.

代码如下：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
public class Solution {
    
    public int (String[] words) {
        if(words == null || words.length == 0) return 0;
        
        int length = words.length;
        
        int[] masks = new int[length];
        //使用masks[i]记录words[i]含有的字符信息
        for(int i = 0; i < length; i++){
            //遍历words[i]的每个字符，masks[i]的最低比特位表示words[i]是否含有字符a(1表示含有
            //，0表示不含)，最高位表示是否含有字符z
            for(char ch: words[i].toCharArray()){
                masks[i] |= 1 << (ch - 'a');
            }
        }
        int maxProduct = 0;
        for(int i = 0; i < length; i++){
            for(int j = i+1; j < length; j++){
                //(masks[i] & masks[j]) == 0表示两个word没有相同的字符
                if((masks[i] & masks[j]) == 0){
                    maxProduct = Math.max(maxProduct, words[i].length()*words[j].length());
                }
            }
        }
        
        return maxProduct;
    }
}

或者优化一下：

1
2
3
4
5
6
7大专栏

标签：Product,Word,Lengths,maxProduct,masks,int,length,words,word
来源： https://www.cnblogs.com/lijianming180/p/12239753.html