//ListNode代表一個(gè)節(jié)點(diǎn)
 
class ListNode{
    public int val;
    public ListNode next;
 
    //構(gòu)造方法
    public ListNode(int val){
        this.val = val;
    }
}

//MyLinkedList 代表這是一個(gè)鏈表
 
public class MyLinkedList {
    public ListNode head;//鏈表的頭引用，所以定義在鏈表里，head是鏈表的頭，不是節(jié)點(diǎn)的頭，節(jié)點(diǎn)只有兩個(gè)屬性，一個(gè)屬性是val值，一個(gè)屬性是next值，所以不能定義在ListNode類(lèi)里面
    ListNode listNode = new ListNode(2);//節(jié)點(diǎn)實(shí)例化，val域賦值為2
}

/MyLinkedList 代表這是一個(gè)鏈表
public class MyLinkedList {
    public ListNode head;//鏈表的頭引用，所以定義在鏈表里
    public  void createList(){
        ListNode listNode0 = new ListNode(11);
        ListNode listNode1 = new ListNode(26);
        ListNode listNode2 = new ListNode(23);
        ListNode listNode3 = new ListNode(45);
        ListNode listNode4 = new ListNode(56);
        listNode0.next = listNode1;
        listNode1.next = listNode2;
        listNode2.next = listNode3;
        listNode3.next = listNode4;
        this.head = listNode0;
    }

//打印鏈表
    public  void display(){
         ListNode cur = this.head;
         while (cur != null){
             System.out.print(cur.val+" ");
             cur = cur.next;
         }
        System.out.println();
    }

 //查找是否包含關(guān)鍵字key是否在單鏈表當(dāng)中
    public boolean contains(int key) {
        ListNode cur = this.head;
        while (cur != null) {
            if (cur.val == key) {
                return true;
            }
            cur = cur.next;
        }
        return false;
    }

    //得到單鏈表的長(zhǎng)度
    public int size(){
        ListNode cur = this.head;
        int count = 0;
        while(cur != null){
            count++;
            cur = cur.next;
        }
        return count;
    }

 //頭插法
 
    public void addFirst(int data) {
        ListNode node = new ListNode(data);
        if (this.head == null) {
            this.head = node;
        } else {
            node.next = this.head;
            head = node;
        }
    }

//尾插法
 
    public void addLast(int data){
        ListNode node = new ListNode(data);
        ListNode cur = this.head;
        if(this.head == null){
            this.head = node;
        }else {
            while(cur.next != null){
                cur = cur.next;
            }
            cur.next = node;
 
        }
    }

public ListNode findIndex(int index){
        ListNode cur = this.head;
        while(index -1 != 0){
            cur = cur.next;
            index--;
        }
        return cur;
 
    }
    //任意位置插入,第一個(gè)數(shù)據(jù)節(jié)點(diǎn)為0號(hào)下標(biāo)
    public void addIndex(int index,int data){
        if(index < 0 || index > size()){
            System.out.println("位置不合法");
            return;
        }
            if(index == 0){
                addFirst(data);
                return;
            }
            if(index == size()){
                addLast(data);
                return;
            }
 
            ListNode cur = findIndex(index);
            ListNode node = new ListNode(data);
            node.next = cur.next;
            cur.next = node;
 
    }

//刪除第一次出現(xiàn)關(guān)鍵字為key的節(jié)點(diǎn)
    public void remove(int key){
        if(this.head == null){
            System.out.println("沒(méi)有你要?jiǎng)h除的節(jié)");
            return;
        }
       if (this.head.val == key){
           this.head = this.head.next;
           return;
        }
       ListNode cur = this.head;
       while (cur.next != null){
           if(cur.next.val == key){
               cur.next = cur.next.next;
               return;
           }
           cur = cur.next;
       }
       if(cur.next == null){
           System.out.println("沒(méi)有該節(jié)點(diǎn)");
           return;
       }
 
    }

    //刪除所有值為key的節(jié)點(diǎn)
    public ListNode removeAllKey(int key){
        if(this.head == null) return null;
        ListNode prev = this.head;
        ListNode cur = this.head;
        while (cur != null){
            if(cur.val == key){
                prev.next = cur.next;
                cur = cur.next;
            }else{
                    prev = cur;
                    cur = cur.next;
            }
        }
        if(this.head.val == key){
            this.head = this.head.next;
        }
        return this.head;
 
    }