Problems:
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.
Solution:
1 class Solution { 2 public: 3 int hammingWeight(unsigned int n) { 4 5 int i=0; 6 while(n>0) 7 { 9 int temp = n&0x1; 10 if(temp==1) 11 { 12 i++; 13 } 14 n=n>>1; 15 } 16 return i; 17 18 } 19 };
时间: 2024-10-10 16:10:36