Package g1401_1500.s1437_check_if_all_1s_are_at_least_length_k_places_away

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    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:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • 0 &lt;= k &lt;= nums.length

    • nums[i] is 0 or 1

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Boolean kLengthApart(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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