单链表和双向链表java实现

单链表

class Node{
    public Node(int i){
        this.value = i;
        }
    int value;
    Node next;
}
public void insert(Node node){
    Node p;
    p = head;
    if (p == null){
        node.next = p;
        head = node;
    }else {
        Node pre;
       for (;;){
            pre = p;
            p = p.next;
           if (p == null){
            break;
        }
        }
        pre.next = node;
        node.next = p;
}
}

双向链表

class Node {
    public Node(int i) {
        this.value = i;
    }

    int value;
    Node next;
    Node prev;
}

    public void insert(Node node) {
        Node p;
        p = head;
        if (p == null) {
            node.next = p;
            head = node;
        } else {
            Node pre;
            for (; ; ) {
                pre = p;
                p = p.next;
                if (p == null) {
                    break;
                }
            }
            pre.next = node;
            node.next = p;
            node.prev = pre;
        }
    }