题解 | #【模板】循环队列#

import java.util.ArrayDeque;
import java.util.Deque;
import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {

    private static Deque<Integer> queue = new ArrayDeque<>();
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        final int MAX_SIZE = in.nextInt();
        final int NUM = in .nextInt();
        
        for (int i = 0; i != NUM; ++i) {
            String ops = in.next();

            if (ops.equals("push")) {
                int x = in.nextInt();
                if (queue.size() == MAX_SIZE) {
                    System.out.println("full");
                } else {
                    queue.addLast(x);
                }  
            }

            if (ops.equals("front")) {
                if (queue.isEmpty()) {
                    System.out.println("empty");
                } else {
                    System.out.println(queue.peekFirst());
                }  
            }

            if (ops.equals("pop")) {
                if (queue.isEmpty()) {
                    System.out.println("empty");
                } else {
                    System.out.println(queue.pollFirst());
                }  
            }
        }
    }
}