<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>

import collections

class Solution:
    def minMoves(self, nums: List[int], k: int) -> int:
        if k == 1:
            return 0

        arr = []

        c = 0
        has_1 = False
        for v in nums:
            if v == 0:
                c += 1
            else:
                if has_1:
                    arr.append(c)
                c = 0
                has_1 = True

        l = collections.deque(arr[:(k-1) // 2])
        l_sum = sum(l)
        r = collections.deque(arr[(k-1) // 2:k-1])
        r_sum = sum(r)

        l_moves = sum((i+1)*l[i] for i in range(len(l)))
        r_moves = sum((len(r) - i)*r[i] for i in range(len(r)))

        res = l_moves + r_moves
        for v in arr[k-1:]:
            rl = r[0]
            new = v

            l_moves = l_moves - l_sum + len(l) * rl
            l.append(rl)
            l_sum += rl - l.popleft()

            r_moves = r_moves + r_sum - (len(r) + 1) * rl + new
            r.append(new)

            r_sum += new - r.popleft()
            res = min(res, l_moves + r_moves)

        return res


20400