【LeetCode 0338】【位运算/递归式】求比特位

338. Counting Bits

Given an integer n, return *an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1’s in the binary representation of *i.

Example 1:

**Input:** n = 2
**Output:** [0,1,1]
**Explanation:**
0 --> 0
1 --> 1
2 --> 10

Example 2:

**Input:** n = 5
**Output:** [0,1,1,2,1,2]
**Explanation:**
0 --> 0
1 --> 1
2 --> 10
3 --> 11
4 --> 100
5 --> 101

Constraints:

• 0 <= n <= 10^5

Follow up:

• It is very easy to come up with a solution with a runtime of O(n log n). Can you do it in linear time O(n) and possibly in a single pass?
• Can you do it without using any built-in function (i.e., like __builtin_popcount in C++)?

Idea

我们知道 数i 与 数i&(i-1) 两个数据之间包含比特1的关系位 C(i) = C(i&(i-c)) +1
可以定义递归函数C，从0到n开始，对C填充，最后C(n)即为答案

JavaScript Solution

/**
 * @param {number} n
 * @return {number[]}
 */
var countBits = function(n) {
    let bits = Array(n+1).fill(0)
    for(let i=1;i<=n;i++){
        bits[i] = bits[i&(i-1)]+1
    }
    return bits
};