实现单链表的基本操作

public class LinkedList {
    //定义数据类来存储结点信息
    class Node{
       private Node next = null;
       private int data;
        public Node(int data){
            this.data = data;
        }

    }
     Node head = null;// 链表头引用初始化为空

//  头插
 public void addFirst(int x){
     Node newNode = new Node(x);
     if (this.head == null){
         this.head = newNode;
     }else{
         newNode.next = head;
         this.head = newNode;
     }
 }
 //尾插
public void addLast(int y){
    Node newNode = new Node(y);
    Node cur = this.head;
    if (cur == null){
        cur = newNode;
    }else{
        while (cur.next != null){
            cur = cur.next;
        }
        cur.next = newNode;
    }
}
//打印链表
public void printList(){
    Node tem = head;
    while (tem != null){
        System.out.print(tem.data);
        tem = tem.next;
    }

}
//获取长度
public int size(){
    Node cur = this.head;
    int count = 0;
    while(cur != null){
        cur = cur.next;
        count++;
    }
    return count;
}

//删除index后一个位置的节点
public void deleteNode(int index) {
    if(index == 1 ){
        System.out.println("删除位置不合法！");
        return;
    }
    Node cur = this.head;
    int length = 0;

    while(cur.next != null){
        length++;

        if(length == index){
            cur.next = cur.next.next;
            return;
        }
        cur = cur.next;

    }

}
    public static void main(String[] args) {
        LinkedList list = new LinkedList();
        list.addFirst(9);
        list.addFirst(5);
        list.addFirst(2);
        list.addFirst(7);

        System.out.print("头插之后：");
        list.printList();
        System.out.println();
        list.addLast(9);
        list.addLast(5);
        list.addLast(2);
        list.addLast(7);
        System.out.print("尾插之后：");
        list.printList();
        System.out.println();
        list.deleteNode(3);
        System.out.print("删除第三个节点之后： ");
        list.printList();


    }
}