6.队列复习

import java.util.Iterator;

public class Queue<T> implements Iterable<T> {
    // 记录首结点
    private Node head;
    // 记录最后一个结点
    private Node last;
    //记录队列中元素的个数
    private int N;

    public Queue() {
        head = new Node(null, null);
        last = null;
        N = 0;
    }

    //判断队列是否为空
    public boolean isEmpty() {
        return N == 0;
    }

    //返回队列中元素的个数
    public int size() {
        return N;
    }

    public void clear() {
        head.next = null;
        last.next = null;
        N = 0;
    }

    //向队列中插入元素t
    public void enqueue(T t) {
        if (last == null) {
            last = new Node(t, null);
            head.next = last;
        } else {
            Node oldLast = last;
            last = new Node(t, null);
            oldLast.next = last;
        }
        //个数+1
        N++;
    }

    //从队列中拿出一个元素
    public T dequeue() {
        if (isEmpty()) {
            return null;
        }
        Node oldFirst = head.next;
        head.next = oldFirst.next;
        N--;
        if (isEmpty()) {
            last = null;
        }
        return oldFirst.item;
    }

    @Override
    public Iterator<T> iterator() {
        return new QIterator();
    }

    private class Node {
        public T item;
        public Node next;

        public Node(T item, Node next) {
            this.item = item;
            this.next = next;
        }
    }

    private class QIterator implements Iterator<T> {
        private Node n = head;

        @Override
        public boolean hasNext() {
            return n.next != null;
        }

        @Override
        public T next() {
            Node node = n.next;
            n = n.next;
            return node.item;
        }
    }

    public static void main(String[] args) {
        Queue<String> queue = new Queue<>();
        queue.enqueue("a");
        queue.enqueue("b");
        queue.enqueue("c");
        queue.enqueue("d");
        for (String str : queue) {
            System.out.print(str + " ");
        }
        System.out.println("-----------------------------");
        String result = queue.dequeue();
        System.out.println("出列了元素：" + result);
        System.out.println(queue.size());

        int[] a = {6, 3, 1, 7, 5, 8, 9, 2, 4};
        Queue<Integer> que = new Queue<>();
        for (int i = 0; i < a.length; i++) {
            que.enqueue(a[i]);
        }
        while (!que.isEmpty()) {
            Integer dequeue1 = que.dequeue();
            System.out.print(dequeue1+" ");
            Integer dequeue2 = que.dequeue();
            if(dequeue2==null){
                break;
            }
            que.enqueue(dequeue2);
        }
    }

}