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

---

思路：
抄作业https://blog.csdn.net/lym940928/article/details/81370242，关键部分引用：

i&(i-1)的含义为，将i的从右往左的第一个1变为0，这样可以使得i变小，以便可以从已经找到的结果中寻找结果。然后再加1给加回来即可。

---

代码实现：

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> ans(num+1, 0);
        
        for (int i = 1; i <= num; ++i){
            ans[i] = ans[i&(i-1)] + 1;
        }
        
        return ans;
    }
};

---

参考：
https://blog.csdn.net/lym940928/article/details/81370242