题目描述:
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.
Credits:
Special thanks to @ts for adding this problem and creating all test cases.
Subscribe to see which companies asked this question ##
思路分析:
给定一个无符号整数。求整它转化为二进制以后,里面的1的个数
代码:
public class Solution {
// you need to treat n as an unsigned value
public int hammingWeight(int n) {
//用来计数
int count = 0;
for(int i = 0;i < 32;i++){
if((n&1) != 0){
count++;
}
n = n>>1;
}
return count;
}
} ##