###### leetcode-190&191 Reverse Bits & Number of 1 Bits

Reverse bits of a given 32 bits unsigned integer.

For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), return 964176192 (represented in binary as 00111001011110000010100101000000).

class Solution {
public:
uint32_t reverseBits(uint32_t n) {
stack<int> s;
int k=0;
while( n != 0)
{
s.push(n%2);//存储二进制码
n /= 2;
k++;//计算位数
}
uint32_t sum=0;
for(int i=k; i > 0; i--)
{
sum = sum + s.top()*pow(2 , 32-i);//逆顺序求值
s.pop();
}
return sum;
}
};

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.

class Solution {
public:
int hammingWeight(uint32_t n) {
int k=0;
while(n != 0)
{
if( n % 2)
k++;
n /= 2;
}
return k;
}
};

#### 191. Number of 1 Bits [easy] (Python)

2016-05-05 15:13:57

#### LeetCode 191 -Number of 1 Bits ( JAVA )

2016-04-11 12:50:50

#### Leetcode_190_Reverse Bits

2015-07-13 21:33:35

#### 190. Reverse Bits [easy] (Python)

2016-06-18 11:04:11

#### Reverse bits of a given 32 bits unsigned integer

2015-10-04 16:29:38

#### LeetCode(190) Reverse Bits

2015-03-22 12:46:11

#### 【LeetCode-190】 Reverse Bits(C++)

2016-05-20 23:11:28

#### LeetCode-Number of 1 Bits

2015-03-10 16:49:19

#### 【LeetCode-191】 Number of 1 Bits(C++)

2016-05-20 21:04:27

#### 191. Number of 1 Bits | Java最短代码实现

2016-04-03 00:13:35

## 不良信息举报

leetcode-190&191 Reverse Bits & Number of 1 Bits