leetcode:bits:Counting Bits(338)

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].

---

http://blog.youkuaiyun.com/martin_liang/article/details/50936387

class Solution {  
public:  
    vector<int> countBits(int num) {  

        vector<int> dp(num+1);  

        dp[0] = 0;  

        for (int i=1; i<=num; i++)  
        {  
            if (i%2)  
                dp[i] = dp[i/2]+1;  
            else  
                dp[i] = dp[i/2];  
        }  

        return dp;  
    }  
};