任务调度器 II

import java.util.*;
import java.util.stream.*;

/**
 * Solution for the given Leetcode problem using Java Streams.
 * The idea remains the same, but we utilize streams to handle the processing.
 */
public class SolutionStream {
    public int minDaysToCompleteTasks(int[] tasks, int space) {
        Map<Integer, Integer> lastPerformed = new HashMap<>();
        AtomicInteger days = new AtomicInteger();

        Arrays.stream(tasks).forEach(task -> {
            days.incrementAndGet();
            if (lastPerformed.containsKey(task)) {
                int lastDay = lastPerformed.get(task);
                if (days.get() - lastDay <= space) {
                    days.set(lastDay + space + 1);
                }
            }
            lastPerformed.put(task, days.get());
        });

        return days.get();
    }

    public static void main(String[] args) {
        SolutionStream sol = new SolutionStream();
        int[] tasks1 = {1, 2, 1, 2, 3, 1};
        int space1 = 3;
        System.out.println(sol.minDaysToCompleteTasks(tasks1, space1)); // Output: 9

        int[] tasks2 = {5, 8, 8, 5};
        int space2 = 2;
        System.out.println(sol.minDaysToCompleteTasks(tasks2, space2)); // Output: 6
    }
}