src/main/java/com/fishercoder/solutions/_2134.java

package com.fishercoder.solutions;

import java.util.ArrayList;
import java.util.List;

public class _2134 {
    public static class Solution1 {
        /**
         * Connect the original array with itself to simulate the circular property of this array.
         * Then use a sliding window to find the minimum swaps.
         */
        public int minSwaps(int[] nums) {
            int ones = 0;
            List<Integer> list = new ArrayList<>();
            for (int num : nums) {
                ones += num;
                list.add(num);
            }
            for (int num : nums) {
                list.add(num);
            }
            int minSwaps = nums.length;
            int zeroes = 0;
            for (int left = 0, right = 0; right < list.size(); right++) {
                if (list.get(right) == 0) {
                    zeroes++;
                }
                int len = right - left + 1;
                if (len < ones) {
                    continue;
                } else if (len == ones) {
                    minSwaps = Math.min(minSwaps, zeroes);
                } else {
                    if (list.get(left) == 0) {
                        zeroes--;
                    }
                    left++;
                    minSwaps = Math.min(minSwaps, zeroes);
                }
            }
            return minSwaps;
        }
    }
}