这是一道动态规划题目
递推公式为: res[0] = 0;
res[1] = 1;
从第三项开始:res[k] = res[k/2]+res%2;
class Solution {
public:
vector<int> countBits(int n) {
vector<int> result;
if(n==0){
result.push_back(0);
return result;
}
if(n==1){
result.push_back(0);
result.push_back(1);
return result;
}
result.push_back(0);
result.push_back(1);
for(int i=2;i<=n;i++){
result.push_back(result[i/2]+i%2);
}
return result;
}
};