LeetCode： 338. Counting Bits

题目描述： 

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 1:

Input: 2
Output: [0,1,1]

Example 2:

Input: 5
Output: [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.

即：给定num，求 0 - num 这 num + 1 个数的二进制形式包含的1的个数。

法一：通过移位运算，求数 i 二进制表示中1的个数。

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> res;        
        int temp;    // 用于求i中1的个数的临时变量
        int count;   // 用于计数
        for(int i = 0; i <= num; ++i) {
            count = 0;
            temp = i;
            while(temp > 0){
                if(temp % 2)
                    count++;
	        temp = temp >> 1;
            }
            res.push_back(count);
        }
        return res;
    }
};

法二：时间O(n)

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

法二很妙，推荐！