单向链表

public class LinkList implements Iterable{
    private Node head;      //记录首结点
    private int N;  //记录链表的长度

    private class Node{
        //储存数据
        T item;
        //下一个结点
        Node next;
        public Node(T item,Node next){
            this.item = item;
            this.next = next;
        }
    }

    public LinkList(){
        //初始化头结点
        this.head = new Node(null,null);
        //初始化元素个数
        this.N = 0;
    }

    /**
     * 清空线性表
     */
    public void clear(){
        this.head.next = null;
    }

    /**
     * 判断线性表是否为空
     */
    public boolean ifEmpty(){
        return this.head.next==null;
    }

    /**
     * 获取线性表中元素的个数
     */
    public int length(){
        return N;
    }

    /**
     * 读取并返回线性表中第i个元素
     */
    public T get(int i){
        Node n = head.next;
        for(int index=0;index iterator() {
        return null;
    }

    public class LIterator implements Iterator{
        private Node n;
        public LIterator(){
            this.n= head;
        }
        public boolean hasNext(){
            return n.next!=null;
        }

        public Object next(){
            n=n.next;
            return n.item;
        }
    }
}