第一种,通过 Integer.bitCount(index) 方法
public int[] countBits(int num) { int[] memo = new int[num + 1]; int index = 0; while (index <= num) { memo[index] = Integer.bitCount(index); index++; } return memo; }
第二种: f(1~1) = f(0~0) +1; b=1
f(2~3)=f(0~1)+1; b=2
f(4~7)=f(0~3)+1; b=4
......
public int[] countBits(int num) { int[] memo = new int[num + 1]; int index = 0, b = 1; while (b <= num) { while (index <= b && index + b <= num) { memo[index + b] = memo[index] + 1; index++; } index = 0; b <<= 1; } return memo; }
第三种与第二种类似 f(i)=f(i/2)+(i&1)
public int[] countBits(int num) { int[] memo = new int[num + 1]; for (int i = 1; i <= num; i++) { memo[i] = memo[i >> 1] + (i & 1); } return memo; }
第四种 f(i)=f(i&(i-1))+1
public int[] countBits(int num) { int[] memo = new int[num + 1]; for (int i = 1; i <= num; i++) { memo[i]=memo[i&(i-1)]+1; } return memo; }