LeetCode Çözümlerİ – 338. Counting Bits

LeetCode içerisinde bulunan “Counting Bits”‘ sorusunun açıklaması ve çözümü. Bu soruda verilen bir integer dizisinin O(n) zamanında ve O(n) space complexity olacak şekilde her bir elemanın binary gösterimlerinin içerisinde bulunan 1 bit sayısı yine bir integer dizisi olarak dönmemizi istiyor.

🔥 LeetCode 338. Counting Bits: https://leetcode.com/problems/counting-bits/

➡️ Problem açıklaması: 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 1:

Input: 2

Output: [0,1,1]

Example 2:

Input: 5

Output: [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.

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.