题解 | #求int型正整数在内存中存储时1的个数#
求int型正整数在内存中存储时1的个数
https://www.nowcoder.com/practice/440f16e490a0404786865e99c6ad91c9
#include <iostream>
#include<vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> binary;
while(n!=0){
binary.push_back(n%2); //获得二进制数的逆序
n/=2;
}
int sum=0;
for(int i=binary.size()-1;i>=0;i--){ //逆序检索1
sum+=binary[i];
}
cout<<sum;
return 0;
}
