简单的单链表

只实现了add()和get()方法，采用tail指针，使得添加节点非常简单。

public class SingleLinkedList<T> {

    int size = 0;
    Node<T> head, tail;

    public SingleLinkedList() {
        head = tail = null;
    }

    public void add(T data) {
        if (size == 0) {
            head = tail = new Node<T>(data, null);
        } else {
            tail.next = new Node<T>(data, null);
            tail = tail.next;
        }
        size++;
    }

    public Node<T> get(int index) {
        if (index < 0 || index >= size) {
            throw new IndexOutOfBoundsException("Index:" + index + ",size:" + size);
        }
        Node<T> node = head;
        for (int i = 0; i < index; i++) { //当index=0时，i不小于index(零不小于零)，于是直接return头结点，head不是哑元
            node = node.next;           //对头结点进行迭代
        }
        return node;
    }

    public int size(){
        return size;
    }

    public static void main(String[] args){
        SingleLinkedList<Integer> list=new SingleLinkedList<Integer>();
        list.add(1);
        list.add(2);
        list.add(3);
        for(int i=0;i<list.size();i++){
            System.out.println(list.get(i).getData());
        }
    }


class Node<T> {

    T data;
    Node<T> next;

    public Node(T data, Node<T> next) {
        this.data = data;
        this.next = next;
    }

   public T getData(){
       return data;
    }

    public void setData(T data){
        this.data=data;
    }
 }

}