Java如何实现LinkedList按索引下标进行插入

public static void main(String[] args) {
        LinkedList integers = new LinkedList();
        integers.add(1);
        integers.add(8);
        integers.add(1,3);
        for (Integer t : integers) {
            System.out.print(t+" ");
        }
    }

public void add(int index, E element) {
        checkPositionIndex(index);//根据下面1 2两个方法 发现如果越界会抛出越界异常

        if (index == size)
            linkLast(element);//当插入元素下标为size 直接调3 直接插入尾巴
        else
            linkBefore(element, node(index));//调用5前先调用4 找到所在下标的那个结点succ。在5里新建一个结点 前节点为succ的前结点 后见点为succ。
    }

//1
private void checkPositionIndex(int index) {
        if (!isPositionIndex(index))
            throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
    }

//2
private boolean isPositionIndex(int index) {
        return index >= 0 && index  size;
    }

//3
 void linkLast(E e) {
        final Node l = last;
        final Node newNode = new Node(l, e, null);
        last = newNode;
        if (l == null)
            first = newNode;
        else
            l.next = newNode;
        size++;
        modCount++;
    }

//4 
 Node node(int index) {
        // assert isElementIndex(index);
        //这里很巧妙的利用了双向链表的特点 前1/2从前开始找 后1/2从后向前
        if (index > 1)) {
            Node x = first;
            for (int i = 0; i )
                x = x.next;
            return x;
        } else {
            Node x = last;
            for (int i = size - 1; i > index; i--)
                x = x.prev;
            return x;
        }
    }


//5
void linkBefore(E e, Node succ) {
        // assert succ != null;
        final Node pred = succ.prev;
        final Node newNode = new Node(pred, e, succ);
        succ.prev = newNode;
        if (pred == null)
            first = newNode;
        else
            pred.next = newNode;
        size++;
        modCount++;
    }