import java.util.List;

/**
 * Created with IntelliJ IDEA.
 * Description: 鏈表
 * User: mac
 * Date: 2022-08-31
 * Time: 10:09
 */

//ListNode代表一個(gè)節(jié)點(diǎn) - 存放在一個(gè)節(jié)點(diǎn)類中
class ListNode {
    public int val;
    public ListNode next;

    public ListNode(int val) {
        this.val = val;
    }
}
public class MyLinkedList {
    public ListNode head;//鏈表的頭引用

    //打印鏈表
    public void display() {
        //this.head.next != null 會(huì)丟失一個(gè)數(shù)據(jù)
        ListNode cur = this.head;
        while (cur != null) {
            System.out.print(cur.val + " ");
            cur = cur.next;
        }
        System.out.println();
    }

    //查找是否包含關(guān)鍵字k
    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() {
        int count = 0;
        ListNode cur = this.head;
        while (cur != null) {
            count++;
            cur = cur.next;
        }
        return count;
    }

    //頭插法
    public void addFirst(int data){
        //綁定位置的時(shí)候一定要先綁定后邊
        ListNode node = new ListNode(data);
        node.next = this.head;
        this.head = node;
    }

    //尾插法
    public void addLast(int data){
        ListNode node = new ListNode(data);
        if (this.head == null){//判空，否則就會(huì)造成引用異常this.head.next
            this.head = node;
        } else {
            ListNode cur = this.head;
            while (cur.next != null){
                cur = cur.next;
            }
            //cur.next = null;
            cur.next = node;
        }
    }

    public ListNode findindex(int index){//通過(guò)下表來(lái)移動(dòng)指針
        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("index位置不合法！");
            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("單鏈表為空，不能刪除！");
            return;
        }
        if (this.head.val == key){//判斷頭部是否為目標(biāo)節(jié)點(diǎn)
            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;
        }
        System.out.println("未找到該節(jié)點(diǎn)");
    }

    //刪除所有值為key的節(jié)點(diǎn)
    public ListNode removeAllKey(int key){
        if (this.head == null) return null;

        ListNode prev = this.head;
        ListNode cur = this.head.next;

        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;
    }

    //清空鏈表
    public void clear(){
        //this.head = null;//暴力解決 - 不推薦但沒(méi)毛病
        while (this.head != null){
            ListNode curNext = this.head.next;
            this.head.next = null;
            this.head = curNext;
        }
    }

}