clueless coding // TODO: be smarter

LeetCode Number of 1 Bits: Java Solution



TL;DR Code Solution


// you need to treat n as an unsigned value
public int hammingWeight(int n) {
 int ones = 0;
	while(n!=0) {
		ones = ones + (n & 1);
		n = n>>>1;
	}
	return ones;

}