LeetCode:Maximum Product of Word Lengths
来源:互联网 发布:中学生直播软件 编辑:程序博客网 时间:2024/05/16 01:31
Total Accepted: 5729 Total Submissions: 15214 Difficulty: Medium
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.
思路:
1.预处理(1)先将字符串数组words以长度从大到小排序;
2.预处理(2)将words中的每个字符串(word)中含有的字母用分别用整数来保存(保存方法见代码);
3.求product(结果):两层loop,两两比较,用&运算对2中的整数进行比较(判断是否有相同字母);
其中还有两个可“剪枝”技巧。
code:
class Solution {public: int maxProduct(vector<string>& words) { int len = words.size(); if(0==len) return 0; sort(words.begin(), words.end(), cmp); // 【1】 vector<int> bits(len,0); for(int i=0;i<len; i++) for(int j=0;j<words[i].size();j++){ bits[i] |= 1 << (words[i][j]-'a'); // 【2】 } int maxSqu = 0; for(int i=0;i<len; i++) { // 【3】 if(words[i].size() * words[i].size() <= maxSqu) break; // 剪枝 for(int j=i+1;j<len;j++) { if(!(bits[i] & bits[j])) { int tmp = words[i].size() * words[j].size(); maxSqu = tmp > maxSqu ? tmp:maxSqu; break; // 剪枝 } } } return maxSqu; } static bool cmp(string a, string b) { return a.size() > b.size(); }};
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
- IOS开发懒加载
- 当你想要放弃时,请用心看看这副漫画
- 《深入理解JVM》学习笔记(1)
- Android之WebView仿微信中图片操作(含二维码识别)
- smb协议读写远程文件
- LeetCode:Maximum Product of Word Lengths
- 简易自定义seg与tableview联动布局
- CakePHP控制器向视图传值总结
- IIC设备驱动实例
- Cannot assign to 'self' outside of a method in the init family
- SourceTree 使用教程
- 做北京linux培训哪家好?
- Android:进度条
- 常用网址