Leetcode------Number of 1 Bits

Title:	Number of 1 Bits
Pass Rate:	40%
Difficulty:	Simple

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.

Show Tags is the number of decimal numbers to the binary number has a few 1. The most basic way is to check the 32-bit scan, I look at the Web page to find a simple method, minus 1, each time the binary minus one, has been reduced to 0,n=n& (n-1); The code is as follows:

1  Public classSolution {2     //You need to treat N as an unsigned value3      Public intHammingweight (intN) {4         intRes=0;5          while(n!=0){6n=n& (n-1);7res++;8         }9         returnRes;Ten     } One}

Leetcode------Number of 1 Bits