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.
题意:
给一个数n,求0-n这些数的二进制表示里有多少1,返回一个数组。
思路:
作弊式的:直接使用Java的Integer.bitCount函数,时间复杂度为O(n),不过还挺快的。
动态规划:一个数的二进制表示有多少1,可以先求它最后一位是1还是0,剩下的就与它的一半相同。即dp[i]=dp[i>>1]+i%2.
代码:
class Solution {
public int[] countBits(int num) {
int []count=new int[num+1];
// for(int i=0;i<=num;i++)
// count[i]=Integer.bitCount(i);
count[0]=0;
for(int i=1;i<=num;i++)
{
count[i]=count[i>>1]+i%2;
}
return count;
}
}