Leetcode: Maximum Product of Word Lengths
来源:互联网 发布:大连电视台直播软件 编辑:程序博客网 时间:2024/06/05 02:21
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.
关键是怎么计算有没有重复字符 - 位运算。想到这个之后就比较简单了,O(N^2)的时间复杂度。
class Solution {public: int maxProduct(vector<string>& words) { vector<int> wordsBit(words.size()); vector<int> wordsLength(words.size()); for (int i = 0; i < words.size(); ++i) { int bits = 0; for (int j = 0; j < words[i].size(); ++j) { bits |= (1 << (words[i][j] - 'a')); } wordsBit[i] = bits; wordsLength[i] = words[i].size(); } int maxLength = 0; for (int i = 0; i < wordsBit.size(); ++i) { for (int j = i + 1; j < wordsBit.size(); ++j) { if ((wordsBit[i] & wordsBit[j]) == 0 && wordsLength[i] * wordsLength[j] > maxLength) { maxLength = wordsLength[i] * wordsLength[j]; } } } return maxLength; }};
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
- FolderSizes v8.0.91
- 【AC自动机】hdu2222 hdu2896 hdu3065 zoj3430 poj2778 hdu2243
- JDBC的学习--尚硅谷
- Unity3D资源相关API介绍
- 解决Android中单个dex文件中方法数越界的问题
- Leetcode: Maximum Product of Word Lengths
- 各种利益导致关注
- 028_CoreAPI_对象三种状态
- 零基础免费搭建个人博客-hexo+github
- 2016-1-7
- 支付系统返回值,错误码,code
- 跟我学习dubbo-简介
- MongoDB数据逻辑结构
- Oracle入门3