Leetcode学习笔记:#338. Counting Bits
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.
实现:
public int[] countBits(int num){
int[] f = new int[num+1];
for(int i = 1; i <= num; i++){
f[i] = f[i>>1] + (i&1);
}
return f;
}
思路:
不会做,马一下