Check If All 1's Are at Least Length K Places Away

Easy

Problem

Given a binary array nums and an integer k, return true if all 1's are at least k places away from each other, otherwise return false.

In other words, for every pair of 1s in the array, there must be at least k elements (zeros) between them.

Constraints

1 <= nums.length <= 10^5
0 <= k <= nums.length
nums[i] is 0 or 1

Examples

Input: nums = [1,0,0,0,1,0,0,1], k = 2

Output: true

Each of the 1s are at least 2 places away from each other. The first and second 1s have 3 zeros between them, and the second and third 1s have 2 zeros between them.

Input: nums = [1,0,0,1,0,1], k = 2

Output: false

The second 1 (index 3) and third 1 (index 5) are only one position apart from each other (distance = 2 - 1 = 1 < k).

Loading...

Loading Python...