diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/max_product_word_len.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/max_product_word_len.cpp')
-rw-r--r-- | other/max_product_word_len.cpp | 31 |
1 files changed, 0 insertions, 31 deletions
diff --git a/other/max_product_word_len.cpp b/other/max_product_word_len.cpp deleted file mode 100644 index e119ea1..0000000 --- a/other/max_product_word_len.cpp +++ /dev/null @@ -1,31 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int maxProduct(vector<string> &words) { - int n = words.size(), ans = 0; - vector<bitset<26>> chars(n); - for (int i = 0; i < n; i++) { - for (auto &ch : words[i]) - chars[i][ch - 'a'] = 1; - for (int j = 0; j < i; j++) - if (!helper(chars[i], chars[j])) - ans = max(ans, words[i].size() * words[j].size()); - } - return ans; - } - -private: - bool helper(bitset<26> &a, bitset<26> &b) { - for (int i = 0; i < 26; i++) - if (a[i] && b[i]) - return true; - return false; - } -}; - -int main() { - Solution obj; - vector<string> words = {"abcw", "baz", "foo", "bar", "xtfn", "abcdef"}; - cout << obj.maxProduct(words); -} |