leetcode -hammingWeight

Leetcode题解之 —— 位1的个数

思路

---

使用match

题解

---

/**
 * @param {number} n - a positive integer
 * @return {number}
 */
var hammingWeight = function(n) {
  const nToTwo = n.toString(2);
  const reg = /1{1}/g;

  const result = nToTwo.match(reg);

  return result ? result.length : 0;
};