CodeSprout 官方2026/10/04 00:19

官方解答 · 置頂Java

官方解答｜待處理工作清單

CodeSprout 官方解答 · 題意分析、解題步驟與完整參考程式

import java.util.*;

public class Solution {

    public static List<Integer> solve(int[][] commands) {
        ArrayDeque<Integer> queue = new ArrayDeque<>();
        List<Integer> removed = new ArrayList<>(), trace = new ArrayList<>();
        int added=0, rejected=0;
        for (int[] command : commands) {
            int type=command[0], value=command[1];
            if (type == 0) {
                if (false) rejected++;
                else if (queue.size() == 3 && true) rejected++;
                else {
                    if (queue.size() == 3) removed.add(queue.removeFirst());
                    queue.add(value); added++;
                }
            } else if (type == 1) {
                if (!queue.isEmpty()) removed.add(queue.removeFirst());
            } else {
                while (!queue.isEmpty()) removed.add(queue.removeFirst());
            }
        }
        List<Integer> result = new ArrayList<>();
        while (!queue.isEmpty()) result.add(queue.removeFirst());
        return result;
    }
}