338. Counting Bits

最新推荐文章于 2022-05-28 13:29:42 发布

PiscesDAI

最新推荐文章于 2022-05-28 13:29:42 发布

阅读量377

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/PiscesDAI/article/details/57296068

本文介绍了一种算法，该算法接收一个非负整数num，并返回一个数组。数组中的每个元素代表从0到num范围内对应整数的二进制表示中1的个数。例如，对于输入5，输出为[0,1,1,2,1,2]。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.

Example:
For num = 5 you should return [0,1,1,2,1,2].

class Solution {
public:
    vector<int> countBits(int num) {
    	vector<int> bits(num+1, 0);
    	for(int j = 0; j <= num; j ++)
    	{
    		for(int i = 31; i >= 0; i --)
    		{
    			if(((j >> i) & 1) == 1)
    			bits[j] ++;
    		}
    	}
    	return bits;
    }
};