［JavaDS］队列

接口： 

public interface IMyQueue {
    // 判断这个队列是否为空
    boolean empty();
    // 返回队首元素，但不出队列
    int peek();
    // 返回队首元素，并且出队列
    int poll();
    // 将 item 放入队列中
    void add(int item);
    // 返回元素个数
    int size();
}

实现： 

public class MyQueue implements IMyQueue{
    class Node{
        private int data;
        private Node next;
        public Node(int data){
            this.data=data;
            this.next=null;
        }
    }
    private Node front;
    private Node rear;
    private int usedSize;
    public MyQueue(){
        this.front=null;
        this.rear=null;
        this.usedSize=0;
    }
    @Override
    public boolean empty() {
        return false;
    }
    // 返回队首元素，但不出队列
    @Override
    public int peek() {
        if(empty()) {
            throw new UnsupportedOperationException("队列为空");
        }
        return this.front.data;
        }
    // 返回队首元素，并且出队列
    @Override
    public int poll() {
        if(empty()){
            throw new UnsupportedOperationException("队列为空");
        }
        int oldData=this.front.data;
        this.front=this.front.next;
        this.usedSize--;
        return oldData;
    }
    @Override
    public void add(int item){
        Node node=new Node(item);
        if(this.front==null){
            this.front=node;
            this.rear=node;
        }else{
            this.rear.next=node;
            this.rear=node;
        }
        this.usedSize++;
    }

    @Override
    public int size() {
        return 0;
    }

}