LeetCode：Counting Bits（高效计算n内所有数的置位数）

LeetCode：Counting Bits（高效计算n内所有数的置位数）

---

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.

Hint:

You should make use of what you have produced already.
Divide the numbers in ranges like [2-3], [4-7], [8-15] and so on. And try to generate new range from previous.
Or does the odd/even status of the number help you in calculating the number of 1s?

---

class Solution {
public:
    vector<int> countBits(int num) {
        int len=num+1;
        vector<int> vi(len);
        vi[0]=0;
        for(int i=1,count=4;i<len;++i)
        {
            if(i<4)
            {
                switch(i)
                {
                    case 1:vi[1]=1;break;
                    case 2:vi[2]=1;break;
                    case 3:vi[3]=2;break;
                }
            }
            else
            {
                /*0：0，1：1，2：1，3：2
                * 4：1，5：2，6：2，7：3取4余-&3
                * 8：2，9：2......取8余-&7
                */
                vi[i]=vi[i&(count-1)]+1;//取当前阶段的余对应+1
                if(i/count==2)
                {
                    count*=2;
                }
            }
        }
        return vi;
    }
};

---

今天刷完了Easy题，表示开始Medium，这个题目是个开始。这个题目还蛮好玩的，找到规律就好了，多写几个。

高效计算余数
http://blog.csdn.net/bestzem/article/details/51472073