[LeetCode] Counting Bits
来源:互联网 发布:数组可以不指定长度吗 编辑:程序博客网 时间:2024/06/08 04:39
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.
Hint:
- You should make use of what you have produced already.
- Divide the numbers in ranges like [2-3], [4-7], [8-15] and so on. And try to generate new range from previous.
- Or does the odd/even status of the number help you in calculating the number of 1s?
解题思路
要实现O(n)的时间复杂度,显然得利用之前的计算结果。我们可以根据位运算来实现,一个数中1的位数等于它右移1位的数中1的位数加上原来的数与1相与的结果。
实现代码
// Runtime: 3 mspublic class Solution { public int[] countBits(int num) { int[] bits = new int[num + 1]; for (int i = 1; i <= num; i++ ) { bits[i] = bits[i / 2] + (i & 0x1); } return bits; }}
0 0
- leetcode:bits:Counting Bits(338)
- [leetcode] 338. Counting Bits
- 【LeetCode-338】Counting Bits
- leetcode-338-Counting Bits
- leetcode:Counting Bits
- [C]LeetCode:Counting Bits
- LeetCode Counting Bits
- leetcode 338. Counting Bits
- leetcode Counting Bits
- [LeetCode]338. Counting Bits
- LeetCode#338. Counting Bits
- Leetcode 338 Counting Bits
- [LeetCode] 338. Counting Bits
- LeetCode之Counting Bits
- LeetCode 338. Counting Bits
- LeetCode 338 :Counting Bits
- leetcode--Counting Bits
- [leetcode-338]Counting Bits
- Unknown system variable 'tx_read_only'
- win32控制台应用程序实现定时
- 熵 信息增益 相对熵(KL散度) 互信息
- 系统架构师成长之路(五)
- 深入理解groupByKey、reduceByKey
- [LeetCode] Counting Bits
- iOS代码量统计
- 数组------找零问题
- Android studio 无法修改jdk的location
- iOS保持界面流畅的技巧
- HDFS的一致性分析
- mysql常用的一些命令,查看MySQL服务器配置信息
- Pyqt 浏览器禁止对话框小demo
- HDU-1166- 敌兵布阵(线段树 插点问线)