java双链表实现

package com.haixintext.java;
//节点类
public class Node {
    Node previous;  //上一个节点
    Node next;      //下一个节点
    Object element; //元素数据
    public Node(Node previous,Node next,Object element){
        super();
        this.previous=previous;
        this.next=next;
        this.element=element;
    }
    public Node(Object element){
        super();
        this.element = element;
    }
}

package com.haixintext.java;
//双链表类
public class LinkedList {
    private Node first;
    private Node last;
    private int size;


    public void add(Object obj){
        Node node = new Node(obj);

        if (first==null){
            node.previous=null;
            node.next=null;
            first=node;
            last=node;
            size++;
        }else{
            node.previous=last;
            node.next=null;
            last.next=node;
            last=node;
            size++;
        }
    }

    public String toString(){
        Node temp = first;
        StringBuilder sb = new StringBuilder();
        while (temp!=null){
            sb.append(temp.element+",");
            temp=temp.next;
        }
        return sb.toString();
    }

    public Node getNode(int index){
        if (index<0||index>size-1){
            throw new RuntimeException("索引数字不合法"+index);
        }
        Node temp;
        if(index<size>>1){
            temp = first;
            for(int i=0;i<index;i++){
                temp=temp.next;
            }
        }else{
            temp = last;
            for(int i=size-1;i>index;i--){
                temp=temp.previous;
            }
        }
        return temp;
    }

    public Object get(int index){
        if (index<0||index>size-1){
            throw new RuntimeException("索引数字不合法"+index);
        }
        Node temp=getNode(index);
        return temp.element;
    }

    public void remove(int index){
        if (index<0||index>size-1){
            throw new RuntimeException("索引数字不合法"+index);
        }
        Node temp=getNode(index);
        if(first==temp&&last==temp){
            first=null;
            last=null;
        }else if (first==temp){
            first=temp.next;
            temp.next.previous=null;
        }else if(last==temp){
            last=temp.previous;
            temp.previous.next=null;
        }else{
            temp.previous.next = temp.next;
            temp.next.previous = temp.previous;
        }
        size--;

    }

    public void set(int index,Object obj){
        if (index<0||index>size){
            throw new RuntimeException("索引数字不合法"+index);
        }

        Node node = new Node(obj);
        Node temp = null;
        if(index==0&&size!=0){
            node.next=first;
            first=node;
        }else if(index==0&&size==0){
            first=node;
            last=node;
        }else if(index==size){
            node.previous=last;
            last.next=node;
            last=node;
        }else{
            temp=getNode(index);
            node.previous=temp.previous;
            node.previous.next=node;
            node.next=temp;
            temp.previous=node;
        }
        size++;
    }
    public static void main(String[] args) {
        LinkedList lis = new LinkedList();
        lis.add("a");
        lis.add("b");
        for (int i = 0; i<10;i++){
            lis.add(i);
        }
        System.out.println(lis);
        System.out.println(lis.size);
        lis.set(12,"dwdqw");
        System.out.println(lis);
        System.out.println(lis.size);
    }
}