https://leetcode-cn.com/problems/number-of-1-bits/
遍历二进制字符串
/**
* @param {number} n - a positive integer
* @return {number}
*/
var hammingWeight = function(n) {
let times = 32;
let result = 0;
while (times--) {
if ((n & 1) === 1) {
result++;
}
n = n >>> 1;
}
return result;
};