单链表模仿队列

知己知彼，百战不殆，队列有啥特色：先进先出
写的糙，多担待

/**
 * 用链表模仿队列
 */
public class Code03 {

    public static class Node{
        private Integer value;
        private Node next;

        public Node(Integer value) {
            this.value = value;
        }

        public Integer getValue() {
            return value;
        }

        public void setValue(Integer value) {
            this.value = value;
        }

        public Node getNext() {
            return next;
        }

        public void setNext(Node next) {
            this.next = next;
        }
    }

    public static class MyQueue {
        private Integer size;
        private Node head;
        private Node tail;
        public MyQueue() {
            size = 0;
        }

        public MyQueue(Integer size) {
            this.size = size;
        }

        public boolean isEmpty(){
            return size==0;
        }

        public Node push(Integer value){
            Node add = new Node(value);
            if(size == 0){
                head = add;
                tail = add;
            } else {
                tail.next = add;
                tail=tail.next;
            }
            size++;
            return head;
        }

        public Integer pop(){
            if(isEmpty()){
                return null;
            }
            Integer value = head.value;
            head = head.next;
            size--;
            return value;
        }

        public Integer peek(){
            if(isEmpty()){
                return null;
            }
            return  head.value;
        }

    }

    public static void main(String[] args) {
        MyQueue stack = new MyQueue();
        stack.push(1);
        stack.push(2);
        stack.push(3);

        System.out.println(stack.peek());
        System.out.println(stack.pop());
        System.out.println(stack.pop());
        System.out.println(stack.pop());
        System.out.println(stack.pop());

    }
}