[LeetCode]Maximum Product of Word Lengths
来源:互联网 发布:苏联东芝事件知乎 编辑:程序博客网 时间:2024/05/18 00:53
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.
这题关键在于如何快速求解两个word是否含有相同的字符。
我们可以用一个32位int型,表示每个字母是否存在。
比如第一位表示字符串中a是否春在,那么第一位置1表示a存在。第二位置1,表示b存在,类似。
那么对两个字符串,可以把他们对应的int类型做与,如果结果不是零,表示某一位都是1,有重复数字,这样就利用bit操作优化复杂度。
class Solution {public: int maxProduct(vector<string>& words) { int len = words.size(); vector<int> BitMap(len,0); int result = 0; for(int i=0; i<len; ++i){ for(int k=0; k<words[i].size(); ++k){ BitMap[i] |= 0x01 << (words[i][k]-'a'); //把对应位置1 } for(int j=0; j<i; ++j){ if (!(BitMap[i] & BitMap[j])) //做与判断是否存在相同字符 result = max(result, int(words[i].size() * words[j].size())); } } return result; }};
0 0
- leetcode Maximum Product of Word Lengths
- Leetcode: Maximum Product of Word Lengths
- 【leetcode】318. Maximum Product of Word Lengths
- leetcode Maximum Product of Word Lengths
- leetcode -- Maximum Product of Word Lengths -- 重点
- Maximum Product of Word Lengths | LeetCode
- Leetcode: Maximum Product of Word Lengths
- LeetCode:Maximum Product of Word Lengths
- Leetcode: Maximum Product of Word Lengths
- [LeetCode 318] Maximum Product of Word Lengths
- LeetCode Maximum Product of Word Lengths
- 318. Maximum Product of Word Lengths LeetCode
- leetcode - Maximum Product of Word Lengths
- [leetcode] 318. Maximum Product of Word Lengths
- LeetCode: 318. Maximum Product of Word Lengths
- LeetCode 318. Maximum Product of Word Lengths
- leetcode 318. Maximum Product of Word Lengths
- LeetCode题解:Maximum Product of Word Lengths
- lua 中pairs 和 ipairs区别
- 栈实现四则运算
- CSS3中的3D旋转 rotate、3D位移 translate
- iOS 开发过程遇到的问题汇总
- 模版方法模式--老大来定义,小弟去实现
- [LeetCode]Maximum Product of Word Lengths
- Win10 安装 PyCUDA Theano
- [面试] C++ 语法(一) —— 初始化列表的初始化顺序
- Mybatis
- 66.enumerateObjects遍历方法详解
- Yii 2.0学习日记:用户登陆详细解析(上)
- CSS相关面试题汇总笔记
- SQL的limit的作用
- [CSAPP]处理机结构