maximum_product_of_word_lengths

Author: hitzzc

README.md

@@ -230,6 +230,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [313. Super Ugly Number](https://github.com/hitzzc/go-leetcode/tree/master/super_ugly_number)
 #### [315. Count of Smaller Numbers After Self](https://github.com/hitzzc/go-leetcode/tree/master/count_of_smaller_numbers_after_self)
 #### [316. Remove Duplicate Letters](https://github.com/hitzzc/go-leetcode/tree/master/remove_duplicate_letters)
+#### [318. Maximum Product of Word Lengths  ](https://github.com/hitzzc/go-leetcode/tree/master/maximum_product_of_word_lengths)
 
 
 

maximum_product_of_word_lengths/maximum_product_of_word_lengths.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    int maxProduct(vector<string>& words) {
+        vector<int> helper(words.size(), 0);
+        for (int i = 0; i < words.size(); ++i) {
+        	for (auto& ch: words[i]) {
+        		helper[i] |= 1 << (ch-'a');
+        	}
+        }
+        int ret = 0;
+        for (int i = 0; i < helper.size(); ++i) {
+        	for (int j = i+1; j < helper.size(); ++j) {
+        		if (helper[i] & helper[j]) continue;
+        		if (words[i].size() * words[j].size() > ret) ret = words[i].size() * words[j].size();
+        	}
+        }
+        return ret;
+    }
+};