![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
位运算
文章平均质量分 80
sscssz
这个作者很懒,什么都没留下…
展开
-
【leetcode题解】【M】【10】318. Maximum Product of Word Lengths
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 le原创 2015-12-23 01:28:31 · 303 阅读 · 0 评论 -
338. Counting Bits【M】【leetcode题解】
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.Example:For num =原创 2016-03-19 14:02:43 · 1275 阅读 · 1 评论 -
【LeetCode】461. Hamming Distance【E】【90】
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.Note:0 ≤ x,原创 2017-02-16 12:32:05 · 509 阅读 · 0 评论 -
【LeetCode】476. Number Complement【E】【59】
Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note:The given integer is guaranteed to fit within the range原创 2017-02-17 11:31:16 · 524 阅读 · 0 评论 -
【LeetCode】500. Keyboard Row【E】【75】
Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below.Example 1:Input: ["Hello", "Alaska", "Da原创 2017-02-17 13:09:32 · 688 阅读 · 0 评论