#1437

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

pupil · 360 · lc easy +23 · verified · 64.3% accepted · 958 likes · top 68%

Description

You are given a binary array nums and an integer k. Return true if every pair of 1s in the array is separated by at least k positions, and false otherwise.

Example 1:

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

Output: true

Explanation: Each of the 1s are at least 2 places away from each other.

Example 2:

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

Output: false

Explanation: The second 1 and third 1 are only one apart from each other.

Code

1

2

3

class Solution:
    def kLengthApart(self, nums: List[int], k: int) -> bool:

class Solution:
    def kLengthApart(self, nums: List[int], k: int) -> bool: