318-Maximum Product of Word Lengths

最新推荐文章于 2024-09-21 16:35:48 发布

kevin聪

最新推荐文章于 2024-09-21 16:35:48 发布

阅读量147

点赞数

分类专栏：算法与数据结构 leetcode 文章标签：算法数据结构 leetcode

本文链接：https://blog.csdn.net/LaputaFallen/article/details/80083310

版权

算法与数据结构同时被 2 个专栏收录

569 篇文章 0 订阅

订阅专栏

leetcode

557 篇文章 12 订阅

订阅专栏

Description

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.

问题描述

给定字符串数组words, 返回words中没有相同字母的两个字符串的最大的长度之积。words中的单词都只有小写字母。如果没有字母都不相同的两个字符串，返回0

问题分析

关键是使用一个整数来保留字符串words[i]中字母的信息, ‘a’对应最低位为1, ‘b’对应次低位为1, 依次类推。
然后遍历字符串，找出最大的长度之积即可

解法

class Solution {
    public static int maxProduct(String[] words) {
        if(words == null || words.length == 0) return 0;

        int len = words.length;
        int[] value = new int[len];

        for(int i = 0; i < len; i++){
            String tmp = words[i];
            //关键是这里的转换
            for(int j = 0; j < tmp.length(); j++)   value[i] |= 1 << (tmp.charAt(j) - 'a');
        }

        int maxProduct = 0;
        for(int i = 0; i < len; i++){
            for(int j = i + 1; j < len; j++){
                //注意这里使用按位与判断
                if((value[i] & value[j]) == 0 && (words[i].length() * words[j].length() > maxProduct)){
                    maxProduct = words[i].length() * words[j].length();
                }
            }
        }

        return maxProduct;
    }
}