<p>You are given an integer array, <code>nums</code>, and an integer <code>k</code>. <code>nums</code> comprises of only <code>0</code>&#39;s and <code>1</code>&#39;s. In one move, you can choose two <strong>adjacent</strong> indices and swap their values.</p>

<p>Return <em>the <strong>minimum</strong> number of moves required so that </em><code>nums</code><em> has </em><code>k</code><em> <strong>consecutive</strong> </em><code>1</code><em>&#39;s</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,0,0,1,0,1], k = 2
<strong>Output:</strong> 1
<strong>Explanation:</strong> In 1 move, nums could be [1,0,0,0,<u>1</u>,<u>1</u>] and have 2 consecutive 1&#39;s.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,0,0,0,0,0,1,1], k = 3
<strong>Output:</strong> 5
<strong>Explanation:</strong> In 5 moves, the leftmost 1 can be shifted right until nums = [0,0,0,0,0,<u>1</u>,<u>1</u>,<u>1</u>].
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,0,1], k = 2
<strong>Output:</strong> 0
<strong>Explanation:</strong> nums already has 2 consecutive 1&#39;s.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>nums[i]</code> is <code>0</code> or <code>1</code>.</li>
	<li><code>1 &lt;= k &lt;= sum(nums)</code></li>
</ul>

class Solution:
    def minMoves(self, nums: List[int], k: int) -> int:
        if k == 1:
            return 0
        ones = 0
        half = (k + 1) >> 1
        leftSum = rightSum = 0
        for i, num in enumerate(nums):
            if not num:
                continue
            ones += 1
            if ones < half:
                leftSum += i
                if ones == 1:
                    left = i
            elif ones == half:
                mid = i
            else:
                rightSum += i
                if ones == k:
                    right = i
                    break
        if k == 2:
            left = mid
        if k & 1:
            leftHalf = rightHalf = half - 1
        else:
            leftHalf, rightHalf = half - 1, half
        leftOffset = (leftHalf*leftHalf - leftHalf) >> 1
        rightOffset = (rightHalf*rightHalf - rightHalf) >> 1
        cur = res = (
            leftHalf * (mid - 1) - leftSum - leftOffset +
            rightSum - rightHalf * (mid + 1) - rightOffset
        )
        n = len(nums)
        while True:
            right += 1
            while right < n and not nums[right]:
                right += 1
            if right == n:
                break
            rightSum += right
            leftSum -= left
            left += 1
            while not nums[left]:
                left += 1
            leftSum += mid
            mid += 1
            while not nums[mid]:
                mid += 1
            rightSum -= mid
            cur = (
                leftHalf * (mid - 1) - leftSum - leftOffset +
                rightSum - rightHalf * (mid + 1) - rightOffset
            )
            res = min(res, cur)
        return res
20600