Package g1701_1800.s1703_minimum_adjacent_swaps_for_k_consecutive_ones

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1703 - Minimum Adjacent Swaps for K Consecutive Ones.

    Hard

    You are given an integer array, nums, and an integer k. nums comprises of only 0's and 1's. In one move, you can choose two adjacent indices and swap their values.

    Return the minimum number of moves required so that nums has k consecutive 1's.

    Example 1:

    Input: nums = 1,0,0,1,0,1, k = 2

    Output: 1

    Explanation: In 1 move, nums could be 1,0,0,0,1,1 and have 2 consecutive 1's.

    Example 2:

    Input: nums = 1,0,0,0,0,0,1,1, k = 3

    Output: 5

    Explanation: In 5 moves, the leftmost 1 can be shifted right until nums = 0,0,0,0,0,1,1,1.

    Example 3:

    Input: nums = 1,1,0,1, k = 2

    Output: 0

    Explanation: nums already has 2 consecutive 1's.

    Constraints:

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

    • nums[i] is 0 or 1.

    • 1 &lt;= k &lt;= sum(nums)

    • 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 Integer minMoves(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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