力扣 338. 比特位计数 1ms, 99.95%

循环中每次直接计算两个数即可，边界需要另外处理

public static int[] countBits(int num) {
	int[] result = new int[num + 1];
	if (num == 0) {
		return result;
	}
	result[1] = 1;
	for (int i = 2; i + 1 <= num; i += 2) {
		result[i] = result[i / 2];
		result[i + 1] = result[i] + 1;
	}
	if ((num & 1) == 0) {
		result[num] = result[num / 2];
	}
	return result;
}