LeetCode题目:338. Counting Bits
来源:互联网 发布:最新一手淘宝买家数据 编辑:程序博客网 时间:2024/05/07 16:40
题目原址:点击打开链接
题目描述:
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]
.
Follow up:
- It is very easy to come up with a solution with run time O(n*sizeof(integer)). But can you do it in linear timeO(n) /possibly in a single pass?
- Space complexity should be O(n).
- Can you do it like a boss? Do it without using any builtin function like __builtin_popcount in c++ or in any other language.
我的代码:
时间复杂度应该是O(num*log(num))
class Solution {public: vector<int> countBits(int num) { vector<int> result; for(int i=0;i<=num;i++){ int k=i; int sum=0; while(k){ int j; j=k%2; k=k/2; if(j==1)sum++; } result.push_back(sum); } return result; }};
0 0
- LeetCode题目:338. Counting Bits
- [leetcode] 338. Counting Bits
- leetcode 338. Counting Bits
- [LeetCode]338. Counting Bits
- LeetCode#338. Counting Bits
- [LeetCode] 338. Counting Bits
- LeetCode 338. Counting Bits
- [LeetCode]338. Counting Bits
- LeetCode-338. Counting Bits
- LeetCode *** 338. Counting Bits
- (leetcode) 338. Counting Bits
- #leetcode#338. Counting Bits
- LeetCode 338. Counting Bits
- leetcode 338. Counting Bits
- LeetCode-338. Counting Bits
- LeetCode-338. Counting Bits
- leetcode-338. Counting Bits
- Leetcode 338. Counting Bits
- 如何高效利用GitHub
- 游标概念作用以及orcle游标的使用
- VTK "Failed getting the TextRenderer instance"解决办法
- ionic入门之多组件开发模式
- 【Spring Boot教程】快速搭建spring boot项目工程
- LeetCode题目:338. Counting Bits
- 根文件系统的原理——Linuxrc本质,rootfs有哪些目录,VFS简介
- Java 对象比较
- 链表--素数链表
- 深入分析重定向和转发
- Bat编写参考
- 排序(2)二分排序、快速排序、归并排序
- printf函数常用的输出方式及格式化输出说明
- memset用法小结