利用双向链表实现LinkedList

//双向链表的节点元素
public class Node {

    private Node previous;

    private Node next;

    private Object o;

    public Node getPrevious() {
        return previous;
    }

    public Node() {

    }

    public Node(Node previous, Node next, Object o) {
    super();
    this.previous = previous;
    this.next = next;
    this.o = o;
    }

    public void setPrevious(Node previous) {
        this.previous = previous;
    }

    public Node getNext() {
        return next;
    }

    public void setNext(Node next) {
        this.next = next;
    }

    public Object getO() {
        return o;
    }

    public void setO(Object o) {
        this.o = o;
    }

}

//利用双向链表实现的Linkedlist
public class MyLinkedList {

    private Node fist;

    private Node last;

    private int size;

    public void add(Object o) {
    Node node = new Node();
    if (fist == null) {// 如果是个空的链表，则设为首节点
        node.setO(o);
        node.setNext(null);
        node.setPrevious(null);
        fist = node;
        last = fist;
    } else {
        node.setO(o);
        node.setPrevious(last);
        node.setNext(null);
        last.setNext(node);
        last = node;
    }
    size++;
    }

    // 范围检查
    private void rangeCheck(int index) {
    if (index < 0 || index >= size) {
        try {
        throw new Exception();
        } catch (Exception e) {
        e.printStackTrace();
        }
    }
    }

    public Node node(int index) {
        rangeCheck(index);
        Node temp = null;
        if (index < (size >> 1)) {// >>效率最快
            temp = fist;
            for (int i = 0; i < index; i++) {
            temp = temp.getNext();
            }
        } else {
            temp = last;
            for (int i = 0; i < size - index - 1; i++) {
            temp = temp.getPrevious();
            }
        }
        return temp;
    }

    // 根据下标删除元素
    public void remove(int index) {
    Node node = node(index);//此时node变量指向链表中下标为index的节点
    if(node != null){
        Node front = node.getPrevious();
        Node behind = node.getNext();
        if(front!=null){//如果node是first节点 front 为null
        front.setNext(behind);
        }
        behind.setPrevious(front);
        size--;
    }
    }

    public Object get(int index){
    Node node = node(index);
    if(node!=null){
        return node.getO();
    }
    return null;
    }

    public void add(int index,Object o){
    Node node = node(index);
    Node newNode = new Node();
    newNode.setO(o);
    if(node!=null){
        newNode.setNext(node);
        newNode.setPrevious(node.getPrevious());
        node.setPrevious(newNode);
        size++;
    }
    }

    public static void main(String[] args) {
    MyLinkedList list = new MyLinkedList();
    list.add("aaa");
    list.add("bbb");
    list.add("ccc");
    System.out.println(list.get(2));
    list.remove(0);
    System.out.println(list.size);
    }
}