count java,count java中的1位数

我在做一个leetcode问题时遇到了一个奇怪的问题.这是关于

Java中的位表示.

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.

我的解决方案是

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 >>> i) % 2 == 1){

++count;

}

}

return count;

}

}

由于输入大小写,因此不接受此代码：

4294967295(11111111111111111111111111111111)

我在java中查看了整数的位表示但是仍然不知道解决方案的问题？谁能帮助我？