题目:
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.
分析:
这道题设定给定一个32位10进制整数,要求统计其二进制数中1的个数。一种方法是不断位移和做”与”运算,32位就要操作32次,时间复杂度较高;另一种方法通过实践发现,n&(n-1)会消去一个1,也就是n和n-1每做一次“与”运算消去一个1。可以循环做”与”运算,直到为0.
代码:
public class HammingWeight {
/**
*
* @param n
* @return
*/
public static int HammingCode(int n){
int re=0;
while(n!=0){
int left=n & 0X1;
re +=left;
n=n>>1;
}
return re;
}
/**
*
* @param n
* @return
*/
public static int Hamin(int n){
int re=0;
while(n!=0){
n=n&(n-1);
++re;
}
return re;
}
public static void main(String[] args){
int n=11;
int result=Hamin(n);
System.out.println("result:"+result);
}
}