forked from haoel/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
numberOf1Bits.cpp
26 lines (24 loc) · 834 Bytes
/
numberOf1Bits.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
// Source : https://leetcode.com/problems/number-of-1-bits/
// Author : Hao Chen
// Date : 2015-03-30
/**********************************************************************************
*
* 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.
*
* Credits:Special thanks to @ts for adding this problem and creating all test cases.
*
**********************************************************************************/
class Solution {
public:
int hammingWeight(uint32_t n) {
int cnt = 0;
for(;n>0; n/=2){
if (n & 0x1) cnt++;
}
return cnt;
}
};