• 32位为依次判断是否为1：
class Solution {
public:
     int  NumberOf1(int n) {
         int result = 0;
         for (int i = 0; i < 32; i++) {
             result += (n >> i) & 1;
         }
         return result;
     }
};