队列---单链表 尾入头出

class Node {

    public int data;

    public Node next;

   public Node(int data) {

        this.data = data;

    }

    }

    public class MyQueue {

       public Node head;

        public Node tail;

        public int usedSize;

        //入队

        public void offer(int data) {

            Node node = new Node(data);
            if (this.head == null) {
                this.head = node;
                this.tail = node;
            }else {
                tail.next=node;
                tail=tail.next;
            }
            this.usedSize++;
        }

        //出队
        public int poll() {
            if (this.head==null){
                throw new
                        UnsupportedOperationException("队列为空");
            }
        int oldData=this.head.data;
        this.head=this.head.next;
        this.usedSize--;
        return oldData;
        }

        //得到队列的对头元素并且不删除
        public int peek() {
            if (this.head==null){
                throw new
                        UnsupportedOperationException("队列为空");
            }
        return this.head.data;
        }
        //size
            public int size(){
            return this.usedSize;
            }
    }
    public class TestDemo1 {
    public static void main(String[] args) {
        MyQueue myQueue=new MyQueue();
        myQueue.offer(1);
        myQueue.offer(2);
        myQueue.offer(3);
        myQueue.offer(1);
        myQueue.offer(2);
        myQueue.offer(3);
        System.out.println(myQueue.size());
        System.out.println(myQueue.peek());
        System.out.println(myQueue.poll());
    }
    }