第五天：线性表-单链表实现

package cn.mdj.singlelink;

class LinkD{
    private class Node{
        private Object data;
        private Node next;
        public Node(Object d){
            this.data = d;
        }
        public void addNode(Node newNode){
            if(this.next == null){
                this.next = newNode;
            }else{
                this.next.addNode(newNode);
            }
        }
        
        public boolean containsNode(Object data){
            if(data.equals(this.data)){
                return true;
            }else{
                if(this.next != null){
                    return this.next.containsNode(data);
                }
                return false;
            }
        }
        
        public boolean removeNode(Node pre,Object data){
            if(this.data.equals(data)){
                pre.next = this.next;
                return true;
            }else{
                if(this.next != null){
                    this.next.removeNode(this, data);
                }
                return false;
            }
        }
        
        public Object getNode(int index){
            if(LinkD.this.foot == index){
                return this.data;
            }else{
                if(this.next != null){
                    LinkD.this.foot++;
                    this.next.getNode(index);
                }
                return null;
            }
        }
        
        public void toArrayNode(){
            LinkD.this.resData[LinkD.this.foot++] = this.data;
            if(this.next != null){
                this.next.toArrayNode();
            }
        }
    }
    
    private Node root;
    private int count = 0;
    private Object[] resData = null;
    private int foot = 0;
    
    public void add(Object data){
        Node newNode = new Node(data);
        if(this.root == null){
            this.root = newNode;
        }else{
            this.root.addNode(newNode);
        }
        count++;
    }
    
    //可以添加，当然可以删除，但删除前需要判断是否包含此数据
    public boolean contains(Object data){
        if(data == null || this.root == null){
            return false;
        }else{
            return this.root.containsNode(data);
        }
    }
    
    //remove
    public boolean remove(Object data){
        if(this.contains(data)){
            if(this.root.data.equals(data)){
                this.root = this.root.next;
                count--;
                return true;
            }else{
                count--;
                return this.root.next.removeNode(this.root,data);
            }
        }else{
            return false;
        }
    }
    
    //获取指定对象
    public Object get(int index){
        if(index >= count){
            return null;
        }else{
            this.foot = 0;
            return this.root.getNode(index);
        }
    }
    
    public boolean isEmpty(){
        return count == 0;
    }
    
    public int getSize(){
        return this.count;
    }
    
    public Object[] toArray(){
        if(this.root == null){
            return null;
        }
        this.foot = 0;
        this.resData = new Object[count];
        this.root.toArrayNode();
        return resData;
    }
}

public class LinkDemo {

    /**
     * @param args
     */
    public static void main(String[] args) {
        LinkD all = new LinkD() ;
        all.add("Hello") ;
        all.add("World") ;
        all.remove("World") ;
        Object array [] = all.toArray() ;    // 取得全部数据
        for (int x = 0 ; x < array.length ; x ++ ) {
            System.out.println(array[x]) ;
        }
        System.out.println(all.contains("Hello")) ;
        System.out.println(all.get(0)) ;
        System.out.println(all.get(1)) ;

    }

}