Leetcode338. Counting Bits

最新推荐文章于 2023-12-19 12:04:55 发布

magic_jiayu

最新推荐文章于 2023-12-19 12:04:55 发布

阅读量106

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/magic_jiayu/article/details/104453652

版权

leetcode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

Leetcode338. Counting Bits

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.

Example 1:

Input: 2
Output: [0,1,1]

Example 2:

Input: 5
Output: [0,1,1,2,1,2]

Follow up:

It is very easy to come up with a solution with run time O(n*sizeof(integer)). But can you do it in linear time O(n) /possibly in a single pass?
Space complexity should be O(n).
Can you do it like a boss? Do it without using any builtin function like __builtin_popcount in c++ or in any other language.

二进制的特性

奇数的二进制中 1 的个数 = 它前一位偶数的二进制中 1 的个数 + 1
$(3)_{10} = (11)_2\leftarrow \rightarrow(2)_{10} = (10)_2$
$(13)_{10} = (1101)_2\leftarrow \rightarrow(12)_{10} = (1100)_2$
偶数中二进制 1 的个数 = 这个偶数除以 2 后的数的二进制 1 的个数
因为偶数最低位是 0，除以 2 就是右移一位（ $> >$ ），所以 1 的个数是不变的。
$20)_{10} = (10100)_2 >>1 = (1010)_2=(10)_{10}$

动态规划

dp[i]为数i的二进制中 1 的个数。

$\left\{\begin{matrix} dp[i-1]+1 & i\mod2==1 \\ dp[i/2] & i\mod2==0 \end{matrix}\right.$

public int[] countBits(int num) {
    if (num < 0) return new int[0];
    int[] dp = new int[num + 1];
    dp[0] = 0;
    for (int i = 1; i <= num; i++) {
        if (i % 2 == 0) {
            dp[i] = dp[i/2];
        } else {
            dp[i] = dp[i-1] + 1;
        }
    }
    return dp;
}

Three-Line Java Solution

public int[] countBits(int num) {
    int[] f = new int[num + 1];
    for (int i=1; i<=num; i++) f[i] = f[i >> 1] + (i & 1);
    return f;
}

Explaination.
Take number X for example, 10011001.
Divide it in 2 parts:
<1>the last digit ( 1 or 0, which is " i&1 ", equivalent to " i%2 " )
<2>the other digits ( the number of 1, which is " f[i >> 1] ", equivalent to " f[i/2] " )

本题更多解法