338. Counting Bits
来源:互联网 发布:什么叫网络编程 编辑:程序博客网 时间:2024/05/24 06:15
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.
class Solution {public: vector<int> countBits(int num) { vector<int>res(num+1); for(int i = 1;i<=num;i++){ res[i]=res[i&(i-1)]+1; } return res; }};
阅读全文
0 0
- [leetcode] 338. Counting Bits
- 338. Counting Bits
- leetcode 338. Counting Bits
- LeetCodeOJ:338. Counting Bits
- [LeetCode]338. Counting Bits
- LeetCode#338. Counting Bits
- 338. Counting Bits
- [LeetCode] 338. Counting Bits
- LeetCode 338. Counting Bits
- 338. Counting Bits
- [LeetCode]338. Counting Bits
- LeetCode-338. Counting Bits
- LeetCode *** 338. Counting Bits
- 338. Counting Bits
- (leetcode) 338. Counting Bits
- Swift 338. Counting Bits
- #leetcode#338. Counting Bits
- LeetCode 338. Counting Bits
- 小强学AI之
- JavaScript与Java中MD5使用两个例子
- H-S直方图,opencv
- 第1章——引论
- 直方图处理
- 338. Counting Bits
- 简述PHP语言
- PS
- opencv双阈值化
- css3 渐变
- opencv自适应阈值
- opencv固定化阈值
- 数据库优化之sql优化
- 基础课程第一讲0530