【华为OJ】查找整数二进制中1的个数

#include<iostream>
using namespace std;

int main()
{
int n;
cin >> n;
int count = 0;
if (n > 0)
{
while (n)
{
if (n % 2 != 0)
count++;
n = n / 2;
}
cout << count;
}
else if (n < 0)
{
int a = -1 - n;
while (a)
{
if(a% 2 != 0)
count++;
a = a / 2;
}
cout << 32 - count;
}
else cout << count;
return 0;
}

输入：整数
输出：转化成二进制后的1的个数