Question

题目内容

解题思路

Brian Kernighan 算法。

代码实现

const countBits = (n: number): number[] => {
  const result: number[] = new Array(n + 1).fill(0);
  const countOneNums = (n: number): number => {
    let count: number = 0;
    while (n) {
      n &= n - 1;
      ++count;
    }
    return count;
  };
  for (let i = 0; i <= n; i++) {
    result[i] = countOneNums(i);
  }
  return result;
};