Java中自写LinkedList，掌握底层结构

- 太累了啊，头都炸了。画个图方便理解remove（）方法和add（）方法

package tk.zhangwei.collection;

public class SxtLinkedList {
    private Node first;//第一个节点
    private Node last;//最后一个节点

    private int size;

    public void add(Object obj){
        Node n = new Node();
        if(first == null){
            n.setPrevious(null);
            n.obj=obj;
            n.setNext(null);

            first = n;
            last = n;
        }else{
            //直接往last节点后增加节点
            n.setPrevious(last);
            n.obj =obj;
            n.setNext(null);

            last.setNext(n);
            last = n;

        }
        size++;
    }


    public int size(){
        return size;
    }
    /***
     * get 方法
     * @param index
     * @return
     */
    public Object get(int index){
        rangeCheck(index);
        Node temp = node(index);
        if(temp!=null){
            return temp.obj;
        }
        return null;
    }

    /***
     * remove
     * @param index
     * @return
     */
    public void remove(int index){
        rangeCheck(index);
        Node temp = node(index);
        if(temp!=null){
            Node up =temp.getPrevious();
            Node down = temp.getNext();
            up.next = down;
            down.previous = up;
            size--;
        }

    }
    /***
     * add方法
     * @param index
     * @return
     */
    public void add(int index,Object obj){



        Node temp = node(index);

        Node newNode = new Node();
        newNode.obj = obj;

        if(temp!=null){

            Node up = temp.previous;
            up.next = newNode;
            newNode.previous = up;

            newNode.next = temp;
            temp.previous = newNode;
            size++;
        }

    }






    //封装一个遍历方法
    public Node node(int index){
        Node temp = null;
        if(first !=null){
            temp = first;
            for(int i=0;i<index;i++){
                temp = temp.next;
            }
        }
        return temp;
    }




    //封装一个检测index异常     
        private void rangeCheck(int index){
            if(index<0||index>size){
                try {
                    throw new Exception();
                } catch (Exception e) {

                    e.printStackTrace();
                }
            }
        }   
    public static void main(String[] args){
        SxtLinkedList list= new SxtLinkedList();
        list.add("aaaa");
        list.add("bbbb");
        list.add("cccc");
        list.add("dsadsadas");
        list.add("dsadas");
        list.add(1, "best");

        for(int i=0;i<list.size;i++){
            System.out.println(list.get(i));
        }
    }

}

package tk.zhangwei.collection;
/***
 * 用来表示一个节点
 * @author zw
 *
 */
public class Node {
    Node previous;
    Object obj;
    Node next;

    public Node(){

    }

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

    public Node getPrevious() {
        return previous;
    }

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


    public Node getNext() {
        return next;
    }

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




}