g0301_0400.s0338_counting_bits.solution.ts Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
// #Big_O_Time_O(num)_Space_O(num) #2023_10_04_Time_69_ms_(86.81%)_Space_49_MB_(78.01%)

function countBits(n: number): number[] {
    const bits: number[] = [0]
    for (let i = 1; i <= n; i++) {
        bits[i] = bits[Math.floor(i / 2)] + (i % 2)
    }
    return bits
}

export { countBits }