leetcode——338——Counting Bits
来源:互联网 发布:风电中国 知乎 编辑:程序博客网 时间:2024/06/05 16:06
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.
class Solution {public: vector<int> countBits(int num) { vector<int> ret(num + 1, 0); for (int i = 1; i <= num; ++i) ret[i] = ret[i&(i - 1)] + 1; return ret; }};
0 0
- LeetCode之338—-Counting Bits
- LeetCode题解——Counting Bits
- leetcode——338——Counting Bits
- Counting Bits——计数
- LeetCode学习篇一——Counting Bits
- 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
- Codeforces Beta Round #3
- 广义表的基本操作实现
- Codeforces Beta Round #4 (Div. 2 Only)
- Codeforces Beta Round #5
- Providing Resource
- leetcode——338——Counting Bits
- HDU 1878 欧拉回路
- Codeforces Beta Round #6 (Div. 2 Only)
- Codeforces Beta Round #7
- Codeforces Beta Round #8
- HDU 1215七夕节
- 2015年06月17日
- Activity之封装intent
- Greedy Gift Givers