实现带有迭代器的链表

定义一个链表接口

package linked;

public interface ListInterface<T> {  //规定了链表应该实现哪些功能
    //返回当前的节点个数
    public int getSize();

    //在链表表头添加新节点
    public void addHead(T data);

    //在链表尾部添加新节点
    public void addTail(T data);

}

带有迭代器的链表接口

package linked;

import java.util.Iterator;

public interface LIstWithIteratorInterface<T> extends ListInterface<T> {
    //获取迭代器的方法
    public Iterator<T> getIterator();
}

带有迭代器的链表的实现类

package linked;

import java.util.Iterator;

public class LinkListWithIterator<T> implements LIstWithIteratorInterface<T> {
    private Node head;
    private Node tail;
    private int size;

    private class Node{
        private T data;
        private Node next;

        //初始化节点
        public Node(T data) {
            this.data = data;
        }

        @Override
        public String toString() {
            return "Node [ data=" + data + ", next=" + next + "]";
        }
    }

    public LinkListWithIterator() {
        super();
    }

    @Override
    public int getSize() {
        return size;
    }

    @Override
    public void addHead(T data) {
        Node newNode = new Node(data);
        if (size == 0) {
            head = newNode;
            tail = newNode;
        } else {
            newNode.next = head;
            head = newNode;
        }
        size++;
    }

    @Override
    public void addTail(T data) {
        Node newNode = new Node(data);
        if (size == 0) {
            head = newNode;
            tail = newNode;
        } else {
            tail.next = newNode;
            tail = newNode;
        }
        size++;
    }

    //以内部类的形式定义迭代器
    private class IteratorForLinkedList implements Iterator<T> {
        private Node nextNode;

        public IteratorForLinkedList() {
            nextNode = head;
        }

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

        @Override
        public T next() {
            if (hasNext()) {
                Node rs = nextNode;
                nextNode = nextNode.next;
                return rs.data;
            }
            return null;
        }
    }

    @Override
    public Iterator<T> getIterator() {
        return new IteratorForLinkedList();
    }
}

测试

package linked;

import java.util.Iterator;

public class IteratorLinkTest {
    public static void main(String[] args) {
        LinkListWithIterator<Integer> link = new LinkListWithIterator<>();
        link.addHead(1);
        link.addHead(2);
        link.addHead(3);

        Iterator<Integer> iterator = link.getIterator();
        while (iterator.hasNext()) {
            System.out.println(iterator.next());
        }
    }
}