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

난이도 : EASY 

Python

class Solution:
    def kLengthApart(self, nums: List[int], k: int) -> bool:
        
        cnt = -1
        for num in nums:
            if num == 1:
                if cnt != -1:
                    if cnt < k:
                        return False 
                cnt =0
                    
            else:
                if cnt != -1:
                    cnt += 1 
        return True

- time complexity O(n) 

- memory complexity O(1)