Time: 19 ms (20.63%), Space: 24.6 MB (5.74%) - LeetHub

Author: hogan-tech

1548-check-if-all-1s-are-at-least-length-k-places-away/1548-check-if-all-1s-are-at-least-length-k-places-away.py

@@ -0,0 +1,23 @@
+# time complexity: O(n)
+# space complexity: O(n)
+from typing import List
+
+
+class Solution:
+    def kLengthApart(self, nums:  List[int], k: int) -> bool:
+        onesIdx = []
+        for i, num in enumerate(nums):
+            if num:
+                onesIdx.append(i)
+        for i in range(1, len(onesIdx)):
+            if (onesIdx[i] - onesIdx[i - 1] - 1) < k:
+                return False
+        return True
+
+
+nums = [1, 0, 0, 0, 1, 0, 0, 1]
+k = 2
+print(Solution().kLengthApart(nums, k))
+nums = [1, 0, 0, 1, 0, 1]
+k = 2
+print(Solution().kLengthApart(nums, k))