LeetCode 338. 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.

give a num, starting from every number from 0 to num, counting how many 1s in a num’s binary representative.

but first, how to count the number of 1s in a binary represent num? we % 2 and get the number of 1s.
and clearly, we can;t use that for this problem.

public int[] countBits(int num)

actually, this problem can be solved by dp.
How?
let;s think about this, if i is even, then 2i is even too, and then have the same number of 1s, and 2i+1 has one more 1s than i
so
//if i is even, then dp[i] = dp[i/2];
//if i is odd, then dp[i] = dp[i/2] + 1;
remember: 1, 2, 4, 8…then can combine to any numbers from 1 to n

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