LeetCode | 338. Counting Bits

题目

Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1’s in the binary representation of i.

Example 1:

Input: n = 2
Output: [0,1,1]
Explanation:
0 --> 0
1 --> 1
2 --> 10

Example 2:

Input: n = 5
Output: [0,1,1,2,1,2]
Explanation:
0 --> 0
1 --> 1
2 --> 10
3 --> 11
4 --> 100
5 --> 101

Constraints:

0 <= n <= 10^5

代码

class Solution {
public:
    vector<int> countBits(int num) {
        vector<int> bits;
        bits.push_back(0);
        if(num < 1)
            return bits;
        bits.push_back(1);
        if(num < 2)
            return bits;
        int idx1, idx0, bitnum;
        for(int i = 2; i<=num; i++){
            idx0 = i%2;
            idx1 = i>>1;
            bitnum = bits[idx0] + bits[idx1];
            bits.push_back(bitnum);
        }
        return bits;
    }
};

又是一个效率很低的解法233333