Check If All 1's Are at Least Length K Places Away LeetCode solution in Python

1
class Solution:
2
    def kLengthApart(self, nums: List[int], k: int) -> bool:
3
        pre = -k - 1
4
        for i, v in enumerate(nums):
5
            if v:
6
                if i - pre < k + 1:
7
                    return False
8
                else:
9
                    pre = i
10
        return True