Package g1401_1500.s1437_check_if_all_1s_are_at_least_length_k_places_away

Class Solution

java.lang.Object
g1401_1500.s1437_check_if_all_1s_are_at_least_length_k_places_away.Solution
public class Solution extends java.lang.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:

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:

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 Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    boolean
    kLengthApart(int[] nums, int k)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • kLengthApart

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