<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:
        n = len(nums)
        preSum = [0]
        for i in range(n):
            curr = 0
            if nums[i]:
                curr = i
            preSum.append(preSum[-1] + curr)
        dq = deque([])
        res = float("inf")
        s = 0
        for r in range(n):
            s += nums[r]
            if nums[r]:
                dq.append(r)
            if len(dq) == k:
                mid = dq[(k - 1) // 2]
                prefix = preSum[mid] - preSum[dq[0]]
                suffix = preSum[dq[-1] + 1] - preSum[mid + 1]
                prefix_cnt = (k - 1) // 2
                suffix_cnt = k - 1 - prefix_cnt
                dist = prefix_cnt * mid - prefix + suffix - (suffix_cnt * mid)
                dist -= (prefix_cnt * (prefix_cnt + 1) // 2) + (suffix_cnt * (suffix_cnt + 1) // 2)
                res = min(res, dist)
                dq.popleft()
        return res
            
                

27300