/
githubmirror
/
interviews
Обзор
Документация
Войти
/
githubmirror
/
interviews
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
leetcode/dynamic-programming/CountingBits.java
23 строки
851 B
Kevin Naughton Jr
finish renaming files and directories
27 мар 2018, 19:52
27 мар 2018, 19:52
ec6dfb5
Код
Авторство
О чём код?
// 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. public class CountingBits { public int[] countBits(int num) { int[] bits = new int[num + 1]; bits[0] = 0; for(int i = 1; i <= num; i++) { bits[i] = bits[i >> 1] + (i & 1); } return bits; } }