public class Test {
    public static void main(String[] args) {
        L l = new L();
        l.init();
        l.insert(123);
        l.insert(456);
        l.insert(789);
        l.insert(222);
        int removeIndex = l.insert(333);
        l.show();
        l.removeNode(removeIndex);
        l.show();
        System.exit(0);
    }
}
/**
 * 靜態(tài)鏈表
 */
class L {
    private static final int MAX = 100;  //鏈表的最大容量
    private Node node[] = new Node[MAX];
    private int head;  //頭指針,頭指針區(qū)域可存儲(chǔ)數(shù)據(jù)也可以不存儲(chǔ)數(shù)據(jù),只用來做向?qū)?我這里是存儲(chǔ)了數(shù)據(jù).
    class Node {
        public int next = -1;  //指針指向的后一個(gè)節(jié)點(diǎn)
        public int pre = -1;  //指針指向的前一個(gè)節(jié)點(diǎn)
        public long value = -1;  //節(jié)點(diǎn)的值
    }
    /**
     * 初始化鏈表空間,其實(shí)這個(gè)可以在實(shí)例化類的時(shí)候完成的.
     */
    public void init() {
        head = 0;
        for (int i = 0; i < MAX; i++) {
            node[i] = new Node();
            node[i].next = -1;  //為了簡單的實(shí)現(xiàn)下,假設(shè)空值為-1
            node[i].pre = -1;
            node[i].value = -1;
        }
    }
    /**
     * 分配節(jié)點(diǎn)空間,類似于c里的malloc
     *
     * @return int
     */
    public int malloc() {
        for (int i = 0; i < MAX; i++) {
            if (node[i].pre < 0 && node[i].next < 0 && node[i].value < 0) {
                return i;
            }
        }
        System.out.println("malloc fail ,full");
        return -1;
    }
    /**
     * 移除節(jié)點(diǎn)
     *
     * @param indexNode indexNode
     */
    public void removeNode(int indexNode) {
        if (indexNode < 0) {
            System.out.println("removeNode indexNode is error");
            return;
        }
        int preNode = node[indexNode].pre;
        int nextNode = node[indexNode].next;
        node[indexNode].pre = -1;
        node[indexNode].next = -1;
        node[indexNode].value = -1;
        if (nextNode >= 0) {
            node[nextNode].pre = preNode;
        }
        //頭節(jié)點(diǎn)被移除
        if (preNode < 0) {
            head = nextNode;
        } else {
            node[preNode].next = nextNode;
        }
    }
    /**
     * 插入節(jié)點(diǎn)
     *
     * @param v v
     */
    public int insert(long v) {
        int index = head;
        while (node[index].next >= 0) {
            index = node[index].next;
        }
        int insertNodeIndex = malloc();
        if (insertNodeIndex < 0) {
            System.out.println("malloc error,please check malloc function.");
            return -1;
        }
        node[insertNodeIndex].value = v;
        if (insertNodeIndex == head) {
            node[insertNodeIndex].pre = -1;
        } else {
            node[index].next = insertNodeIndex;
            node[insertNodeIndex].pre = index;
        }
        return insertNodeIndex;
    }
    /**
     * 測試下顯示這個(gè)鏈表
     */
    public void show() {
        int index = head;
        System.out.println("show l:-------------------------");
        while (node[index].next >= 0) {
            System.out.println(node[index].value);
            index = node[index].next;
        }
        System.out.println(node[index].value);
        System.out.println("show l end:-----------------------");
        System.out.println("test show l start:_______________");
        while (node[index].pre >= 0) {
            System.out.println(node[index].value);
            index = node[index].pre;
        }
        System.out.println(node[index].value);
        System.out.println("test show l end:_______________");
    }
}