原题
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.
Reference Answer
思路分析
依旧是动态规划解决问题,首先,查找规律:
0000 0
-------------
0001 1
-------------
0010 1
0011 2
-------------
0100 1
0101 2
0110 2
0111 3
-------------
1000 1
1001 2
1010 2
1011 3
1100 2
1101 3
1110 3
1111 4
把第i个数分成两种情况,如果i是偶数那么,它的二进制1的位数等于 i/2 中1的位数;如果i是奇数,那么,它的二进制1的位数等于i-1的二进制位数+1,又i-1是偶数,所以奇数i的二进制1的位数等于 i/2 中二进制1的位数+1.
所以上面的这些可以很简单的表达成 res[index] = res[index // 2] + index % 2
。
找规律也是存在技巧的,如参考答案这般,将4位二进制数展开所有情况进行观察,查找规律。
Code
class Solution:
def countBits(self, num):
"""
:type num: int
:rtype: List[int]
"""
if num == 0:
return [num]
res = [0] * (num + 1)
for index in range(1, num+1):
res[index] = res[index // 2] + index % 2
return res
C++ version
class Solution {
public:
vector<int> countBits(int num) {
if (num == 0){
return {0};
}
vector<int> res(num+1, 0);
for (int index = 1; index <= num; index ++) {
res[index] = res[int(index/2)] + index % 2;
}
return res;
}
};
Note
- 对于本题这种情况,明显重点是找规律,找规律已经2的n次方作为分割,更容易看出来一些。
参考文献
[1] https://blog.csdn.net/fuxuemingzhu/article/details/70806676