class Solution {
public:
vector<int> countBits(int num) {
vector<int> V;
V.push_back(0);
for(int ii = 1; ii <= num; ii++) {
int cnt = 0;
for(int bit = 1; bit <= ii; bit <<= 1) if(ii & bit) cnt++;
V.push_back(cnt);
}
return V;
}
};
【leetcode 位运算 C++】338. Counting Bits
猜你喜欢
转载自blog.csdn.net/m0_37454852/article/details/113937151
今日推荐
周排行