BM318Maximum Product of Word Lengths

最新推荐文章于 2023-08-29 11:16:19 发布

eatbanli

最新推荐文章于 2023-08-29 11:16:19 发布

阅读量266

点赞数

分类专栏： Leetcode刷题 Bit

本文链接：https://blog.csdn.net/eatbanli/article/details/53303909

版权

Leetcode刷题同时被 2 个专栏收录

75 篇文章 0 订阅

订阅专栏

Bit

6 篇文章 0 订阅

订阅专栏

                    
                    思路1 Brute Force 
Use brute force two check every pairs. Has TLE problem
 
思路2 Bit 
I want to use Bit, but bit of a and bit of bb always have common 1s with intersection or xor. I have no idea how to use them.
Then I found some code use _char - ‘a’ and then to use bit.