试题
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]
代码
都知道i&(i-1)操作是除掉i的二进制最后一位1。那么操作后的i&(i-1)<i,并且i&(i-1)是一个整数。因此只需要从前往后循环即可。
class Solution {
public int[] countBits(int num) {
int[] counter = new int[num+1];
counter[0] = 0;
for(int i=1; i<=num; i++){
counter[i] = counter[i&(i-1)]+1;
}
return counter;
}
}