Leetcode 318. Maximum Product of Word Lengths

文章作者：Tyan
博客：noahsnail.com | CSDN | 简书

1. Description

2. Solution

解析： Version 1每次迭代都需要进行两次set转换，Version 2预先进行了set转换，效率有提升。由于Version 2中两个字符串的与运算非常耗时，因此Version 3先将字符串转换为代表字符串的数字，然后进行与运算，这样两个字符串的与运算就变成了两个数字按位进行与运算，大大减少了运行时间。Version 4将代表数字一样的字符串进行了合并，并保留了最大的字符串长度，这样减少了与运算的迭代次数，并且不影响最终结果。

Version 1

class Solution:def maxProduct(self, words: List[str]) -> int:words.sort(key=len, reverse=True)maximum = 0n = len(words)for i in range(n):for j in range(i+1, n):x = len(words[i])y = len(words[j])if maximum >= x * y:return maximumintersection = set(words[i]) & set(words[j])if len(intersection) == 0:maximum = max(maximum, x * y)breakreturn maximum

Version 2

class Solution:def maxProduct(self, words: List[str]) -> int:chars = [set(word) for word in words]maximum = 0n = len(words)for i in range(n):for j in range(i+1, n):x = len(words[i])y = len(words[j])intersection = chars[i] & chars[j]if len(intersection) == 0:maximum = max(maximum, x * y)return maximum

Version 3

class Solution:def maxProduct(self, words: List[str]) -> int:lengths = [len(word) for word in words]flags = []for word in words:flag = 0for ch in word:flag = flag | (1 << (ord(ch) - 97))flags.append(flag)maximum = 0n = len(words)for i in range(n):for j in range(i+1, n):if flags[i] & flags[j] == 0:maximum = max(maximum, lengths[i] * lengths[j])return maximum

Version 4

class Solution:def maxProduct(self, words: List[str]) -> int:maximum = 0mapping = {}for word in words:flag = 0for ch in word:flag = flag | (1 << (ord(ch) - 97))mapping[flag] = max(mapping.get(flag, 0), len(word))for key1, value1 in mapping.items():for key2, value2 in mapping.items():if key1 & key2 == 0:maximum = max(maximum, value1 * value2)return maximum

Reference

https://leetcode.com/problems/maximum-product-of-word-lengths/

Leetcode 318. Maximum Product of Word Lengths相关推荐

leetcode 318. Maximum Product of Word Lengths | 318. 最大单词长度乘积
题目 https://leetcode.com/problems/maximum-product-of-word-lengths/ 题解中规中矩的题目,中规中矩的思路,不像是一个 medium 题. ...
318. Maximum Product of Word Lengths
问题:给定一个字符串数组words,找到这样的最大值:length(word[i]) * length(word[j]),words[i]和words[j]没有共同的字母.假设输入字符串只包含小写字母 ...
Maximum Product of Word Lengths
Maximum Product of Word Lengths 题目链接: https://leetcode.com/problems... public class Solution {public ...
LeetCode Maximum Product of Word Lengths(位操作)
问题:给出一个字符串数组,要求求出两个没有共同字符的字符串的最大积思路:第一种方法是直接枚举任意两个字符串,看是否有公共字符,如果没有,则计算乘积,并更新最大值. 第二种方法,因为字符范围是a-z, ...
LeetCode 152. Maximum Product Subarray--动态规划--C++,Python解法
题目地址:Maximum Product Subarray - LeetCode Given an integer array nums, find the contiguous subarray w ...
LeetCode 628. Maximum Product of Three Numbers
题目: Given an integer array, find three numbers whose product is maximum and output the maximum produ ...
【LeetCode】Maximum Product Subarray 求连续子数组使其乘积最大
Add Date 2014-09-23 Maximum Product Subarray Find the contiguous subarray within an array (containin ...
LeetCode 152. Maximum Product Subarray
152. Maximum Product Subarray Find the contiguous subarray within an array (containing at least one ...
Leetcode 2233. Maximum Product After K Increments
题目解法1 首先理解一下题意,要求的是对数组中某些数字增加1后的最大乘积,一共可增加k次.对于每一次增加1,整个乘积的变化是除了被增加这个数字以外的数字总和.那么最后乘积最大也就是k次增加的最多.从 ...
leetcode 1339. Maximum Product of Splitted Binary Tree | 1339. 分裂二叉树的最大乘积（树形dp）
题目 https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/ 题解树形 dp,思路见草稿 /*** Defini ...

Leetcode 318. Maximum Product of Word Lengths

1. Description

2. Solution

Reference

Leetcode 318. Maximum Product of Word Lengths相关推荐

最新文章

热门文章