LinkedList模拟队列的实现

package com.shrimpking.t11;

import java.util.LinkedList;

/**
 * Created by IntelliJ IDEA.
 *
 * @Author : Shrimpking
 * @create 2024/9/10 12:01
 */
public class MyQueue<E>
{
    private LinkedList<E> list = new LinkedList<>();

    //向队尾添加元素
    public void offer(E obj){
        list.offerLast(obj);
    }

    //获取并删除队首的元素
    public E poll(){
        return list.pollFirst();
    }

    //队列是否有元素
    public boolean empty(){
        return list.isEmpty();
    }

    //查看队首元素，但不删除
    public E peek(){
        return list.peekFirst();
    }

    //获取队列中的元素数目
    public int size(){
        return list.size();
    }
}

package com.shrimpking.t11;

/**
 * Created by IntelliJ IDEA.
 *
 * @Author : Shrimpking
 * @create 2024/9/10 12:05
 */
public class QueueTest
{
    public static void main(String[] args)
    {
        MyQueue<String> queue = new MyQueue<>();
        queue.offer("one");
        queue.offer("two");
        queue.offer("three");

        System.out.println(queue.poll());
        System.out.println(queue.peek());
        System.out.println(queue.poll());
        System.out.println(queue.poll());

        if(queue.empty()){
            System.out.println("队列为空");
        }else{
            System.out.println("队列不为空");
        }
    }
}