队列：链表实现

链表队列

队列原则：先进先出
主要用到了单链表的头部删除和尾部添加两个内容

Java实现

import java.util.Iterator;

public class Queue<Item> implements Iterable<Item> {
    private class Node {
        Item item;
        Node next;
    }

    private Node first; // 头
    private Node last;  // 尾
    private int N;      // 个数

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

    public int size() {
        return N;
    }

    // 入队 ---- 相当于单链表尾部添加
    public void enqueue(Item item) {
        Node oldLast = last;
        last = new Node();
        last.item = item;
        last.next = null;
        if (isEmpty())
            first = last;
        else
            oldLast.next = last;
        N++;
    }
    // 出队 ---- 相当于单链表头部删除
    public Item dequeue(){
        Item item = first.item;
        Node oldFirst = first;
        first = first.next;
        if(isEmpty()) last = null;
        N--;
        return item;
    }

    @Override
    public Iterator<Item> iterator() {
        return new ListIterator();
    }

    private class ListIterator implements Iterator<Item> {
        private Node current = first;

        @Override
        public boolean hasNext() {
            return current != null;
        }

        @Override
        public Item next() { // 特别注意，这一步还有移动指针的重任
            Item item = current.item;
            current = current.next;
            return item;
        }

        @Override
        public void remove() {

        }
    }
    public static void main(String[] args) {
        Queue<String> q = new Queue<>();
        System.out.println("元素个数" + q.size());
        q.enqueue("lzp.");
        q.enqueue("baidu");
        q.enqueue(".com");
        q.enqueue(".cn");
        System.out.println("--队列元素个数" + q.size());
        q.dequeue();
        System.out.println("--队列元素个数" + q.size());
        Iterator<String> itr = q.iterator();
        while (itr.hasNext()) {
            System.out.println(itr.next());
        }
    }
}