leetcode:Counting Bits
来源:互联网 发布:常温核聚变 知乎 编辑:程序博客网 时间:2024/06/06 03:09
原题:
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.
题意为:给定一个非负的整数num,对于0<=i<=num的i,计算i对应二进制数中1的个数,并以数组的形式返回
Java 实现:
public class Solution { public int[] countBits(int num) { int[] result = new int[num+1]; for (int i = 0; i <= num; i++) { int temp= i; int c=0; String s = Integer.toBinaryString(temp); for (int j = 0; j < s.length(); j++) { if(s.charAt(j)=='1') c++; } result[i]=c; } return result; }}
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
- python简单基础介绍
- mongoose
- GIT所能设及到的所有命令行
- MMORPG手游AOI解决方案
- Zigbee 直间入网
- leetcode:Counting Bits
- 安装deep learning 的 python开发环境
- IOS设置UIView、UIButton等控件的边框设置为圆角
- Error:Execution failed for task ':app:transformClassesWithDexForDebug'解决记录
- tomcat7启动服务内存溢出
- fflush(stdin)
- OpenStack网络基础——VXLAN网络
- 搜索框edittext
- fflush()