Leetcode 338Counting Bits
来源:互联网 发布:淘宝多店铺管理软件 编辑:程序博客网 时间:2024/05/29 08:17
问题描述
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 time O(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.
Credits:
Special thanks to @ syedee for adding this problem and creating all test cases.
问题分析:利用二进制的特点,所有数都在2^n的某个轮回中,下一个轮回中的1个个数是从0开始到当前轮回开始的那个数为止一一对应的1的个数加1,即:
0 1 2 3 4 5 6 7 8 9
0 1 1 2 1 2 2 3 1 2
1+0 1+1 1+0 1+1 1+1 1+2 1+0 1+1
代码如下:
public int[] countBits(int num) { if(num<0) return null; int[]dp=new int[num+1]; dp[0]=0; if(num==0) return dp; dp[1]=1; int flag=2; int index=0; for(int i=2;i<=num;i++){ if(index==flag){ flag=flag*2; index=0; } dp[i]=1+dp[index++]; } return dp; }
阅读全文
0 0
- leetcode:bits:Counting Bits(338)
- 【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
- Counting Bits leetcode 338
- [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
- CGAL的安装与环境配置
- java中的几个常用流
- Android Studio实用插件集合
- 多个对象无锁
- Java多线程基础
- Leetcode 338Counting Bits
- 详解Spring中bean的scope
- 重写(override)和重载(overload)的区别
- 牛客《剑指Offer》 二维数组中的查找
- [BZOJ]4403: 序列统计 Lucas定理
- python+caffe训练自己的图片数据流程
- 使用java操作Excel
- css设置透明度不影响子元素
- iOS: FFmpeg的使用一