package linkedQueue;

public class HeroNode {
    public int no;
    public String name;
    public String nickname;
    public HeroNode next;//指向下一個節(jié)點(diǎn)

    public HeroNode(int no, String name, String nickname) {
        this.no = no;
        this.name = name;
        this.nickname = nickname;
    }

    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                ", nickname='" + nickname + '\'' +
                '}';
    }


}

package linkedQueue;


import java.util.Stack;

public class SingleLinkedList {
    private HeroNode head = new HeroNode(0, "", "");

    public HeroNode getHead() {
        return head;
    }

    //反向打印節(jié)點(diǎn)
    public static void reversePrint(HeroNode head) {
        if (head.next == null) {
            return;
        }
    //    創(chuàng)建一個棧
        Stack<HeroNode> heroNodes = new Stack<>();
        HeroNode cur = head.next;
        while (cur != null) {
            heroNodes.push(cur); //入棧
            cur = cur.next;
        }
    //    出棧打印
        while (heroNodes.size() > 0) {
            System.out.println(heroNodes.pop());
        }
    }

    /**
     * 添加節(jié)點(diǎn)
     * @param heroNode
     */
    public void add(HeroNode heroNode) {
        HeroNode temp = head;
        while (true) {
            if (temp.next == null) {
                break;
            }
            temp = temp.next;
        }
        temp.next = heroNode;
    }

    /**
     * 有序添加節(jié)點(diǎn)
     * @param herNode
     */
    public void addByOrder(HeroNode herNode) {
        HeroNode temp = head;
        boolean flag = false;
        while (true) {
            if (temp.next == null) {
                break;
            }
            if (temp.next.no > herNode.no) {
                break;
            } else if (temp.next.no==herNode.no) {
                flag = true;
                break;
            }
            temp = temp.next;
        }
        if (flag) {
            System.out.println("你要插入的節(jié)點(diǎn)的編號已經(jīng)存在?。。。?);
        } else {
            herNode.next = temp.next;
            temp.next = herNode;
        }
    }

    /**
     * 更新節(jié)點(diǎn)數(shù)據(jù)
     * @param newHeroNode
     */
    public void update(HeroNode newHeroNode) {
        if (head.next == null) {
            System.out.println("鏈表為空?。。。?);
            return;
        }
        HeroNode temp = head.next;
        boolean flag = false;
        while (true) {
            if (temp == null) {
                break;
            }
            if (temp.no == newHeroNode.no) {
            //    找到
                flag = true;
                break;
            }
            temp = temp.next;
        }
        if (flag) {
            temp.name = newHeroNode.name;
            temp.nickname = newHeroNode.nickname;
        } else {
        //    沒有找到
            System.out.println("沒有找到編號" + newHeroNode.no + "的節(jié)點(diǎn)，不能修改");
        }

    }

    /**
     * 刪除節(jié)點(diǎn)
     * @param no
     */
    public void del(int no) {
        HeroNode temp = head;
        boolean flag = false;
        while (true) {
            if (temp.next == null) {
                break;
            }
            if (temp.next.no == no) {
                flag = true;
                break;
            }
            temp=temp.next;
        }
        if (flag) {
            temp.next = temp.next.next;
        }

    }

    /**
     * 遍歷節(jié)點(diǎn)
     */
    public void showList() {

        if (head.next == null) {
            System.out.println("鏈表為空");
            return;
        }

        HeroNode temp = head.next;
        while (true) {
            if (temp == null) {
                break;
            }
            System.out.println(temp);
            temp = temp.next;
        }

    }

    /**
     * 統(tǒng)計有效節(jié)點(diǎn)的個數(shù)
     */
    public static int getLength(HeroNode head) {
        if (head.next == null) { //空鏈表
            return 0;
        }
        int length = 0;
        HeroNode herNode = head.next;
        while (herNode != null) {
            length++; // 計數(shù)
            herNode=herNode.next; // 指針后移
        }
        return length;
    }

    /**
     * 求倒數(shù)第index個節(jié)點(diǎn)
     * @param head 頭節(jié)點(diǎn)
     * @param index 倒數(shù)第k個
     * @return
     */
    public static HeroNode findLastIndexNode(HeroNode head, int index) {
        // 判斷是否是空鏈表
        if (head.next == null) {
            return null;
        }

        // 拿到鏈表的長度
        int size = getLength(head);
        // index校驗(yàn)，看是否在范圍內(nèi)
        if (index <= 0 || index > size) {
            return null;
        }
        // 定位倒數(shù)第index個節(jié)點(diǎn)
        HeroNode herNode = head.next;
        for (int i = 0; i < size - index; i++) {
            herNode = herNode.next;
        }
        return herNode;

    }

    //單鏈表反轉(zhuǎn)
    public static void reverseList(HeroNode head) {
    //    如果當(dāng)前鏈表為空或者只有一個節(jié)點(diǎn)，直接返回
        if (head.next == null || head.next.next == null) {
            return;
        }

    //    定義輔助變量來遍歷鏈表
        HeroNode cur = head.next;
        HeroNode next = null;//指向當(dāng)前節(jié)點(diǎn)[cur]的下一個節(jié)點(diǎn)
        HeroNode reverseHead = new HeroNode(0, "", "");
    //    遍歷原來節(jié)點(diǎn)，每遍歷一個節(jié)點(diǎn)，將其取出，并放在新的鏈表的最前端
        while (cur != null) {
            next = cur.next;//暫時保存當(dāng)前節(jié)點(diǎn)的下一個節(jié)點(diǎn)
            cur.next = reverseHead.next;//將cur的下一個節(jié)點(diǎn)指向新的鏈表的最前端
            reverseHead.next=cur;//將cur鏈接到新的鏈表
            cur = next;
        }
        head.next = reverseHead.next;

    }

}