191. 位1的个数
public class Solution
{
public int HammingWeight(uint n)
{
var ret = 0;
while(n != 0)
{
ret += (int)(n & 1);
n >>= 1;
}
return ret;
}
}
public class Solution
{
public int HammingWeight(uint n)
{
var ret = 0;
while(n != 0)
{
ret += (int)(n & 1);
n >>= 1;
}
return ret;
}
}