java.lang.Object
g1401_1500.s1437_check_if_all_1s_are_at_least_length_k_places_away.Solution

public class Solution extends Object
1437 - Check If All 1's Are at Least Length K Places Away\. Easy Given an binary array `nums` and an integer `k`, return `true` _if all_ `1`_'s are at least_ `k` _places away from each other, otherwise return_ `false`. **Example 1:** ![](https://assets.leetcode.com/uploads/2020/04/15/sample_1_1791.png) **Input:** nums = [1,0,0,0,1,0,0,1], k = 2 **Output:** true **Explanation:** Each of the 1s are at least 2 places away from each other. **Example 2:** ![](https://assets.leetcode.com/uploads/2020/04/15/sample_2_1791.png) **Input:** nums = [1,0,0,1,0,1], k = 2 **Output:** false **Explanation:** The second 1 and third 1 are only one apart from each other. **Constraints:** * 1 <= nums.length <= 105 * `0 <= k <= nums.length` * `nums[i]` is `0` or `1`
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • kLengthApart

      public boolean kLengthApart(int[] nums, int k)