[LeetCode]191. Number of 1 Bits&338. Counting Bits

191 . Number of 1 Bits
Easy

Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).

For example, the 32-bit integer ’11’ has binary representation 00000000000000000000000000001011, so the function should return 3.

2ms:

// you need to treat n as an unsigned value
    public int hammingWeight(int n) {
        int i = 32;
        int count = 0;
        while(i!=0){
            count += n&1;
            n = n >> 1;
            i--;
        }
        return count;
    }

338 . Counting Bits
Medium

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:
For num = 5 you should return [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.

3ms:

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