那个...暑期实习(打杂),空闲的时候就把leetcode翻出来刷几道。距离上次写博客已经4个月了!
每次自己写完代码,在和网上的大神一对比总会自愧不如。但同时又可以发现很多让人眼前一亮的解法,精神总会为之一振!
题目链接在此:
Write a function that takes an unsigned integer and returns the number of ’1' bits it has (also known as the Hamming weight).
For example, the 32-bit integer ’11' has binary representation 00000000000000000000000000001011
, so the function should return 3.
解法来自这位大神
(1)解法1:右移
class Solution {
public:
int hammingWeight(uint32_t n) {
int count = 0;
while(n)
{
if(n & 1)
count ++;
n = n >> 1;
}
return count;
}
};
解法2:简直高能!
假设n=1111000111000 那n-1 = 1111000110111, (n-1) & n = 1111000110000,刚好把最后一个1给干掉了。也就是说,(n-1)&n 刚好会从最后一位开始,每次会干掉一个1。这样速度就比下面的快了。有几个1,就会执行几次。
class Solution {
public:
int hammingWeight(uint32_t n) {
int count = 0;
while (n)
{
++ count;
n = (n - 1) & n;
}
return count;
}
};