https://leetcode.com/problems/number-of-1-bits/
Write a function that takes an unsigned integer and returns the number of ’1‘ bits it has (also known as the Hamming weight).
For example, the 32-bit integer ’11‘ has binary representation 00000000000000000000000000001011, so the function should return 3.
/** * @param {number} n - a positive integer * @return {number} */ var hammingWeight = function(n) { var res = 0; for (i = n; i !== 0; ){ if(i % 2 === 1){ res++; } i = parseInt(i / 2); } return res; };
[LeetCode][JavaScript]Number of 1 Bits
原文：http://www.cnblogs.com/Liok3187/p/4507962.html