BitMask 相关

2022-05-30 01:01:15 阅读：123 来源： 互联网

标签：return String int Explanation two BitMask words 相关

318. Maximum Product of Word Lengths

Given a string array words, return the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. If no such two words exist, return 0.

Example 1:

Input: words = ["abcw","baz","foo","bar","xtfn","abcdef"]
Output: 16
Explanation: The two words can be "abcw", "xtfn".

Example 2:

Input: words = ["a","ab","abc","d","cd","bcd","abcd"]
Output: 4
Explanation: The two words can be "ab", "cd".

Example 3:

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

Constraints:

2 <= words.length <= 1000
1 <= words[i].length <= 1000
words[i] consists only of lowercase English letters.

暴力解法

class Solution {
    public int maxProduct(String[] words) {
        int max = 0;
        for(int i=0;i<words.length-1;i++){
            for(int j=i+1;j<words.length;j++){
                if(!hasCommon(words[i],words[j]))
                    max = Math.max(max,words[i].length()*words[j].length());
            }
        }
        return max;
    }
    private boolean hasCommon(String w1,String w2){
        for(char c : w1.toCharArray()){
            if(w2.indexOf(c)>=0) return true;
        }
        return false;
    }
}

巧用bitmask，将字符串比对过程从O(len2) 到 O(1)，最终时间复杂度： O(N*N+L) N为字符串个数，L为字符串长度

class Solution {
    public int maxProduct(String[] words) {
        int max = 0;
        int[] state = new int[words.length];
        for(int i=0;i<words.length;i++){
            state[i] = getState(words[i]);
        }
        for(int i=0;i<words.length-1;i++){
            for(int j=i+1;j<words.length;j++){
                if( (state[i] & state[j]) ==0 )
                    max = Math.max(max,words[i].length()*words[j].length());
            }
        }
        return max;
    }
    private int getState(String str){
        int mask = 0;
        for(char c:str.toCharArray()){
            int pos = c-'a';
            mask |= 1<<(pos);
        }
        return mask;
    }
}

bitmask 基础上增加 map对重复字符串集合进行去重，减少比对次数

class Solution {
    public int maxProduct(String[] words) {
        int max = 0;
        Map<Integer,Integer> map = new HashMap();
        
        for(int i=0;i<words.length;i++){
            int bitValue = getState(words[i]);
            map.put(bitValue, Math.max(map.getOrDefault(bitValue,0), words[i].length()));
        }
        int result = 0;
        for(int i:map.keySet()){
            for(int j:map.keySet()){
                if( i!=j && ( (i & j) == 0))
                result = Math.max(result, map.get(i)*map.get(j));
            }
        }
        return result;
    }
    private int getState(String str){
        int mask = 0;
        for(char c:str.toCharArray()){
            int pos = c-'a';
            mask |= 1<<(pos);
        }
        return mask;
    }
}

标签：return,String,int,Explanation,two,BitMask,words,相关
来源： https://www.cnblogs.com/cynrjy/p/16325459.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9

BitMask 相关