package MyLinkedList;

public class Node {
    // 定義數(shù)據(jù)
    Object data;
    // 定義下一結(jié)點(diǎn)
    Node next;

    public Node(Object data, Node next) {
        this.data = data;
        this.next = next;
    }

    public Node() {
    }
}

@Override
    public int size() {
        return size;
    }

 @Override
    public boolean isEmpty() {
        return size == 0;
    }

 @Override
    public Object get(int index) {
        Node p = node;
        for (int i = 0; i < index; i++) {
            p = p.next;
        }

        return p.data;
    }

@Override
    public boolean add(Object o) {
        add(size, o);
        return true;
    }

 @Override
    public void add(int index, Object element) {
        // 找到需要插入的位置的結(jié)點(diǎn)
        Node p = node;
        for (int i = 0; i < index; i++) {
            p = p.next;
        }
        // 創(chuàng)建新結(jié)點(diǎn)
        Node node1 = new Node();

        // 將數(shù)據(jù)存入集合中
        node1.data = element;

        // 讓node1的指針指向下一結(jié)點(diǎn)
        node1.next = p.next;

        // 確定node1的直接前驅(qū)結(jié)點(diǎn)
        p.next = node1;

        // 更新size
        size++;
    }

package MyLinkedList;

public class test {
    public static void main(String[] args) {
        LinkedList linkedList = new LinkedList();
        linkedList.add("111");
        linkedList.add("222");
        linkedList.add("333");
        linkedList.add("444");
        for (int i = 1; i < linkedList.size(); i++) {
            System.out.println(linkedList.get(i));
        }
        System.out.println("==================");
        linkedList.add(2,999);
        for (int i = 1; i < linkedList.size(); i++) {
            System.out.println(linkedList.get(i));
        }

    }
}