g0301_0400.s0338_counting_bits.solution.go 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

package s0338_counting_bits

// #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
// #Big_O_Time_O(num)_Space_O(num) #2024_03_16_Time_0_ms_(100.00%)_Space_4.7_MB_(25.18%)

func countBits(num int) []int {
	result := make([]int, num+1)
	borderPos := 1
	incrPos := 1
	for i := 1; i < len(result); i++ {
		if incrPos == borderPos {
			result[i] = 1
			incrPos = 1
			borderPos = i
		} else {
			result[i] = 1 + result[incrPos]
			incrPos++
		}
	}
	return result
}