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

from typing import List

import collections
class Solution:
    def minMoves(self, nums: List[int], k: int) -> int:


        # left = []
        # right = []
        ones = []
        ans = 99999999999999999999
        prefixsum = []
        a =nums

        t = 0
        for i in a:
            t+=1-i
            prefixsum.append(t)

        for i in range(len(a)):
            if a[i]==1:
                ones.append(i)

        start = 0
        end = 0
        ones_on_left = 0
        ones_on_right = 1
        temp = prefixsum[ones[start]]
        while end - start + 1 < k:
            end += 1
            temp+=prefixsum[ones[end]]
            ones_on_right += 1
        #ans = temp
        for i in range(len(a)):


            ans = min(ans,temp)

            while end+1<len(ones):
                rr = 0
                if i>0:
                    rr = prefixsum[i-1]
                if prefixsum[i]- prefixsum[ones[start]]>prefixsum[ones[end+1]]-rr:
                    temp-=rr- prefixsum[ones[start]]
                    temp+=prefixsum[ones[end+1]]-rr
                    if ones[start]<i:
                        ones_on_left-=1

                    start+=1
                    end+=1
                    if ones[end]>=i:
                        ones_on_right+=1
                else:
                    break
            ans = min(ans, temp)

            if a[i]==1:
                ones_on_left+=1
                ones_on_right-=1
            else:
                temp+=ones_on_left
                temp-=ones_on_right
        return ans
24900