class Solution {
public int[] countBits(int num) {
int[] res = new int[num+1];
for (int i = 1; i <= num; i++) {
res[i] = res[i & (i-1)] + 1;
}
return res;
}
}
注:
x & (x-1) 的2进制1比x要少一个
class Solution {
public int[] countBits(int num) {
int[] res = new int[num+1];
for (int i = 1; i <= num; i++) {
res[i] = res[i & (i-1)] + 1;
}
return res;
}
}
注:
x & (x-1) 的2进制1比x要少一个