Number of 1 BitsMy SubmissionsQuestionEditorial SolutionTotal Accepted: 90511 Total Submissions: 240977 Difficulty: Easy
Write a function that takes an unsigned integer and returns the number of ' 1 ' bits it has (also known as the Hamming weigh T).
For example, the 32-bit integer ' One ' 00000000000000000000000000001011
has a binary representation, so the function should return 3.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
Subscribe to see which companies asked this question
Hide TagsBit ManipulationHide Similar Problems(e) Reverse bits (e) Power of both (M) counting bits
C + + code:
Class Solution {public: int hammingweight (uint32_t n) { int count=0; while (n) { if (N & 1) count++; n >>= 1; } return count; }};
Java code:
public class Solution { //need to treat N as a unsigned value public int hammingweight (int n) { int cnt = 0; while (n!=0) { cnt++; n &= n-1; } return cnt; }}
Leetcode:number of 1 Bits