Java实现 链表实现队列

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u010369338/article/details/71727433

链表实现队列类：

public class QueueLink {
    public Node head;
    private int size = 0;
    public QueueLink() {
        head = new Node();
    }

    public void inQueue(String name) {
        Node q = head;
        Node node = new Node(name);
        while (q.next != null) {
            q = q.next;
        }
        /**
         * 队尾进入
         */
        q.next = node;
        size ++;
    }

    public String outQueue() {
        Node q = head;
        String name = null;
        if (q.next != null) {
            name = q.next.name;
            /**
             * 删除队首的节点
             * 将head next跳跃当前节点指向下个节点
             */
            q.next = q.next.next;
            size --;
        }
        return name;
    }

    public void display() {
        Node p = head;
        while (p.next != null) {
            p = p.next;
            System.out.println(p.name);
        }
    }
    public int size() {
        return size;
    }

}

节点类不贴了，很简单，之前也都贴过，一样的。