java 单向链表实现

链表是一种常用的数据结构，理解了链表的结构和原理，我们也可以使用java来实现一个简易的链表，麻雀虽小五脏俱全，o(^▽^)o

package com.basic.alogrithm;

public class BasicLink {
    public static void main(String[] args) {
        Link<Integer> tests = new Link<Integer>();
        tests.add(4);
        tests.add(3);
        tests.add(5);
        tests.add(4);
        tests.add(6);
        tests.add(4);
        // tests.add(null); // 异常
        System.out.println(tests.size);
        // System.out.println(tests.get(tests.size)); // 异常
        tests.remove(4);
        System.out.println(tests.size);
        System.out.println(tests.get(0));
        System.out.println(tests.get(1));
        System.out.println(tests.get(2));
    }
}

class Link<E> {
    static class Node<E> {
        private E value;
        private Node<E> next;

        public Node(E e) {
            this.value = e;
            this.next = null;
        }
    }
    int size = 0;
    Node<E> header = new Node<E>(null);

    void add(E e) {
        if (e == null) {
            throw new NullPointerException("e == null");
        }
        Node<E> node = new Node<E>(e);
        node.next = header.next;
        header.next = node;
        size++;
    }

    void remove(E e) {
        Node<E> prev = header;
        Node<E> node = header.next;
        while (node != null) {
            if (node.value.equals(e)) {
                Node<E> tmp = node;
                prev.next = node.next;
                node = prev.next;
                tmp.next = null; // for gc
                size--;
            } else {
                prev = node;
                node = node.next;
            }
        }
    }

    E get(int index) {
        if (index < 0 || index >= size) {
            throw new IndexOutOfBoundsException("index < 0 || index >= size");
        }
        int i = 0;
        Node<E> n = header.next;
        for (;n != null; ) {
            if (i == index) {
                return n.value;
            }
            n=n.next;
            i++;
        }
        return null;
    }

    int size() {
        return size;
    }
}