191.Number of 1 Bits

题目链接：number-of-1-bits

/**
 * 
 * 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.
 *
 */

public class NumberOf1Bits {

	
//	600 / 600 test cases passed.
//	Status: Accepted
//	Runtime: 210 ms
//	Submitted: 0 minutes ago

	
    // you need to treat n as an unsigned value
    public int hammingWeight(int n) {
        
    	int count = 0;
    	for(int i = 0; i < 32;i ++)
    		count += (n >> i) & 1;
    	return count;
    }
	public static void main(String[] args) {
		// TODO Auto-generated method stub

	}

}