"Simple Algorithm" 44. Number of bits 1

Topic:

Write a function that the input is an unsigned integer that returns the number of digits in the binary expression as '1'3  000000000000000000000000000010112 1   00000000000000000000000010000000

Problem Solving Ideas:

1. Direct displacement can be shifted to the right 32 times, each time to determine whether the last one is 1;

The code is as follows:

classSolution { Public:    intHammingweight (uint32_t N) {intCount =0;  while(n!=0){            if(n&0x1==1) {Count++; } N= n>>1; }                returncount; }};

2. Observing N&n-1, one 1 will be eliminated.

class Solution {public:    int  hammingweight (uint32_t N) {        int  0;                  while (n!=0) {           ret++           ; = n& (n1);        }                 return ret;    }};

"Simple Algorithm" 44. Number of bits 1