1437

25/11/1437.cpp

@@ -0,0 +1,26 @@
+#include <vector>
+
+bool kLengthApart(std::vector<int> &nums, int k) {
+  int count = 0;
+  bool start = false;
+
+  for (int i = 0; i < nums.size(); ++i) {
+    if (!start) {
+      if (nums[i] == 1) {
+        start = true;
+      }
+      continue;
+    }
+    if (nums[i] == 0) {
+      count++;
+    }
+    if (nums[i] == 1) {
+      if (count < k) {
+        return false;
+      }
+      count = 0;
+    }
+  }
+
+  return true;
+}

25/11/1437.java

@@ -0,0 +1,15 @@
+class Solution {
+    public boolean kLengthApart(int[] nums, int k) {
+        int last = -k - 1;
+        for (int i = 0; i < nums.length; i++) {
+            if (nums[i] != 1) {
+                continue;
+            }
+            if (i - last <= k) {
+                return false;
+            }
+            last = i;
+        }
+        return true;
+    }
+}

25/11/1437.py

@@ -0,0 +1,10 @@
+
+def kLengthApart(self, nums: List[int], k: int) -> bool:
+    last = -k-1
+    for i ,x in enumerate(nums):
+        if x != 1:
+            continue
+        if i - last <= k:
+            return False
+        last = i
+    return True

25/11/go/1437.go

@@ -0,0 +1,15 @@
+package C
+
+func kLengthApart(nums []int, k int) bool {
+	last := -k - 1
+	for i := 0; i < len(nums); i++ {
+		if nums[i] != 1 {
+			continue
+		}
+		if i-last <= k {
+			return false
+		}
+		last = i
+	}
+	return true
+}