add 1437

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1437|[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1437.java) | |Medium|Array|
 |1436|[Destination City](https://leetcode.com/problems/destination-city/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1436.java) | |Easy|String|
 |1432|[Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1432.java) | |Medium|String|
 |1431|[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1431.java) | |Easy|Array|

src/main/java/com/fishercoder/solutions/_1437.java

@@ -0,0 +1,23 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _1437 {
+    public static class Solution1 {
+        public boolean kLengthApart(int[] nums, int k) {
+            List<Integer> indexes = new ArrayList<>();
+            for (int i = 0; i < nums.length; i++) {
+                if (nums[i] == 1) {
+                    indexes.add(i);
+                }
+            }
+            for (int i = 0; i < indexes.size() - 1; i++) {
+                if (indexes.get(i + 1) - indexes.get(i) < k + 1) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}

src/test/java/com/fishercoder/_1437Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1437;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1437Test {
+    private static _1437.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1437.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{1, 0, 0, 0, 1, 0, 0, 1};
+        assertEquals(true, solution1.kLengthApart(nums, 2));
+    }
+
+}