Minimum Swaps to Group All 1's Together II

class Solution:
    def minSwaps(self, nums: List[int]) -> int:
        n = len(nums)
        ones = 0
        for i in range(n):
            ones += nums[i]
            nums[i] = 1^nums[i]
        cnt = 0
        for i in range(ones):
            cnt += nums[i]
        res = cnt
        for i in range(n):
            cnt += nums[(i+ones)%n] - nums[i]
            res = min(res, cnt)
        return res