1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-11-14 09:59:41 +01:00
LeetCode/go/minimum-number-of-k-consecutive-bit-flips.go

34 lines
427 B
Go
Raw Normal View History

package main
import (
arrayqueue "github.com/emirpasic/gods/v2/queues/arrayqueue"
)
func minKBitFlips(bits []int, k int) int {
q := arrayqueue.New[int]()
total := 0
flipped := 0
for i, bit := range bits {
if i >= k {
b, _ := q.Dequeue()
flipped ^= b
}
if flipped != bit {
q.Enqueue(0)
continue
}
if i+k > len(bits) {
return -1
}
q.Enqueue(1)
flipped ^= 1
total++
}
return total
}