LeetCode Solutions
191. Number of 1 Bits
Time: $O(32) = O(1)$ Space: $O(1)$
class Solution {
public:
int hammingWeight(uint32_t n) {
int ans = 0;
for (int i = 0; i < 32; ++i)
if ((n >> i) & 1)
++ans;
return ans;
}
};
public class Solution {
// You need to treat n as an unsigned value
public int hammingWeight(int n) {
int ans = 0;
for (int i = 0; i < 32; ++i)
if (((n >> i) & 1) == 1)
++ans;
return ans;
}
}
class Solution:
def hammingWeight(self, n: int) -> int:
ans = 0
for i in range(32):
if (n >> i) & 1:
ans += 1
return ans