移除所有载有违禁货物车厢所需的最少时间

/*
 * 思路：
 * 1. 使用Stream处理字符串，计算从左端、右端和中间移除违禁车厢的最小时间。
 */
import java.util.stream.IntStream;

public class RemoveIllegalGoodsStream {
    public static int minimumTime(String s) {
        int n = s.length();
        int leftRemoval = (int) IntStream.range(0, n)
            .filter(i -> s.charAt(i) == '1')
            .map(i -> i)
            .average()
            .orElse(0) * 2;

        int rightRemoval = (int) IntStream.range(0, n)
            .filter(i -> s.charAt(n - 1 - i) == '1')
            .map(i -> i)
            .average()
            .orElse(0) * 2;

        int middleRemoval = (int) IntStream.range(0, n)
            .filter(i -> s.charAt(i) == '1')
            .count() * 2;

        return Math.min(leftRemoval, Math.min(rightRemoval, middleRemoval));
    }

    public static void main(String[] args) {
        System.out.println(minimumTime("1100101")); // 输出：5
        System.out.println(minimumTime("0010")); // 输出：2
    }
}