[LeetCode][JavaScript]Number of 1 Bits
浏览数：20 /
时间：2015年06月08日
https://leetcode.com/problems/number-of-1-bits/
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; };
郑重声明：本站内容如果来自互联网及其他传播媒体，其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享，并不代表本站赞同其观点和对其真实性负责，也不构成任何其他建议。
