单链表代码案例

单链表代码案例

public class useData <T>{
    //单链表的数据机构
    static class Node<T>{
        T element;
        Node next;
        public Node(T element){
           this.element=element;
        }
    }
    //头指针
    Node head;
    //为指针
    Node tail;
    int size;
    //数据初始化
    public useData(){
        head=null;
        tail=null;
        size=0;
    }
    //向尾节点添加数据
    public void addList(T element)
    {
        //建立新的节点
        Node newNode=new Node(element);
        if(tail==null){
            //如果为空给尾指针赋值
            tail=newNode;
            //头指针指向尾指针的第一个元素
            head=tail;
        }else {
            //将新的节点赋值给尾节点下一个元素
            tail.next=newNode;
            //移动指针与当前位置
            tail=newNode;
        }
        //链表长度++
        this.size++;
    }
    public void AddList(T element,int Point){
        if(Point>size){
            return;
        }
        Node newNode=new Node(element);
        if(Point==0){
            newNode.next=head;
            head=newNode;
            if (tail == null) {
                tail=newNode;
            }
            this.size++;
        }
        else if(Point==size){
            this.addList(element);
        }
        else {
            Node prev = head;
            for (int i = 0; i < this.size - 1; i++) {
                prev = prev.next;
            }
            Node next = prev.next;
            newNode.next = next;
            prev.next = newNode;
            size++;
        }
    }
    //链表的遍历
    public void search() {
        Node cur = this.head;
        while (cur!=null){
            System.out.println(cur.element);
            cur=cur.next;
        }
        System.out.println("NO");

    }
    //链表元素的删除
    public void delete(int deleteID){
        Node cur=this.head;
        for(int i=0;i<deleteID-2;i++){
            cur=cur.next;
        }
        Node next=cur.next.next;
        cur.next=next;
        this.size--;
    }

}