JAVA 实现链表

package com;

public class Link {
    
    private class Node{
        private Object node;
        private Node next;

        public Node(Object node){
            this.node = node;
        }
        public void addNode(Node newNode){
            if(this.next == null){
                this.next = newNode;
            }else{
                this.next.addNode(newNode);
            }
        }
        public boolean containsNode(Object data){
            boolean isHas = false;
            if(this.node.equals(data)){
                isHas = true ;
            }else{
                if(this.next != null ){
                    isHas = this.next.containsNode(data);
                }else{
                    isHas = false;
                }
            }
            return isHas;
        }
        public Object getNode(){
            return this.node;
        }
        public void toArray(){
            Link.this.resArr [Link.this.foot ++ ] = this.getNode();
            if(this.next != null ){
                this.next.toArray();
            }
        }
        public Object getIndex(int index){
            if(Link.this.foot ++ == index){
                return this.node;
            }else{
                return this.next.getIndex(index);
            }
        }
        public boolean updateIndex(Object newData,int index){
            if(Link.this.foot ++ == index){
                this.node = newData;
                return true;
            }else{
                return this.next.updateIndex(newData, index);
            }
        }
        public boolean removeData(Node node, int index){
            if(Link.this.foot ++ == index){
                node.next = node.next.next;
                Link.this.count --;
                return true;
            }else{
                return this.removeData(node.next,index);
            }
        }
        public boolean removeObject(Node node,Object remObj){
            if(this.node.equals(remObj)){
                node.next = this.next;
                Link.this.count --;
                return true;
            }else{
                return this.next.removeObject(this, remObj);
            }
        }
    }
    private Node root;//链表的根节点
    private int count = 0;
    private Object [] resArr;
    private int foot =0 ;
    
    public void add(Object node){
        if(node == null ){
            return ;
        }
        Node dataNode = new Node(node);
        if(root == null ){
            root = dataNode;
        }else{
            root.addNode(dataNode);
        }
        count ++;
    }
    public boolean contains(Object data){
        if(data == null || this.root == null){
            return false;
        }else {
            return this.root.containsNode(data);
        }
    }
    public boolean isEmpty(){
        return this.root == null ? true :false;
    }
    public int size(){
        return this.count;
    }
    public Object [] toArray(){
        if(this.count == 0){
            return null;
        }
        this.resArr = new Object[this.count]; //实例化数组长度
        this.foot = 0;//进行清零处理，需要进行脚标操作
        this.root.toArray();
        return this.resArr;
    }
    public Object get(int index){
        if(index >= this.count){
            return null;
        }
        if(this.root != null){
            this.foot = 0;
            return this.root.getIndex(index);
        }
        return null;
    }
    public boolean update(Object obj,int index){
        if(this.root == null || index > this.count){
            return false;
        }
        this.foot = 0;//初始化 脚标
        return this.root.updateIndex( obj, index);
    }
    public boolean remove(int index){
        if(this.root == null || index > this.count){
            return false;
        }
        if(index == 0){
            this.root = this.root.next;
            return true;
        }else{
            this.foot = 1;//初始化 脚标
            return this.root.removeData(this.root,index);
        }
    }
    public boolean removeObject(Object remData){
        if(!this.contains(remData)){
            return false;
        }
        if(this.root.node.equals(remData)){
            this.root = this.root.next;
            this.count -- ;
            return true;
        }else{
            return this.root.next.removeObject(this.root,remData);
        }
    }
//------------------------------------------------------------------    
    public static void main(String[] args) {
        Link lk = new Link();
        
        lk.add("12232");
        lk.add("23");
        lk.add("24");
        lk.add("25");
        lk.add("26");
        System.out.println("----------------修改前-------------------");
        Object[] array = lk.toArray();
        for(int i=0;i<array.length;i++){
            System.out.println(array[i]);
        }
        
        lk.removeObject("23");
        System.out.println("----------------修改后-------------------");
        Object[] array1 = lk.toArray();
        for(int i=0;i<array1.length;i++){
            System.out.println(array1[i]);
        }
    }
}