1.题目
LeetCode;338. 比特位计数
【medium】
2.解题
方法一:动态规划
参考:
https://leetcode-cn.com/problems/counting-bits/solution/bi-te-wei-ji-shu-by-leetcode-solution-0t1i/
java:
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;
}
}
时间复杂度:O(n)
空间复杂度:O(n)