public class Node {
    public int data;
    public String name;
    public Node next;
    public Node(int data, String name){
        this.data = data;
        this.name = name;
    }
    @Override
    public String toString() {
        return "Node{" +
                "data=" + data +
                ", name='" + name + '\'' +
                '}';
    }
}

private Node head = new Node(0,"");

public class SingleLinkedList {
    //首先創(chuàng)建頭結(jié)點(diǎn)，此結(jié)點(diǎn)表示鏈表的頭，無具體數(shù)據(jù)
    private Node head = new Node(0,"");
    //添加結(jié)點(diǎn)操作
    public void addData(Node node){
        Node temp = head;
        while (true){
            if (temp.next == null){
                temp.next = node;
                node.next = null;
                break;
            }
            temp = temp.next;
        }
    }
}

     public void delData(Node node){
        Node temp = head;
        while (true){
            //如果是要刪除的結(jié)點(diǎn)
            if (temp.next.data == node.data){
                temp.next = temp.next.next;
                break;
            }else if(temp.next == null){
                System.out.println("未找到結(jié)點(diǎn)！");
                break;
            }
            temp = temp.next;
        }
    }

    public int countData(){
        Node temp = head.next;
        int count = 0;
        while (true){
            if (temp == null){
                break;
            }
            count++;
            temp = temp.next;
        }
        return count;
    }

    public Node referNode(int n){
        //根據(jù)前面計(jì)算有效個(gè)數(shù)的方法，求得鏈表總結(jié)點(diǎn)個(gè)數(shù)
        int max = countData();
        //計(jì)數(shù)
        int count = 1;
        //判斷指定的結(jié)點(diǎn)是否在范圍內(nèi)
        if (!(n >= 1 && n <= max)){
            throw new RuntimeException("沒有此結(jié)點(diǎn)!");
        }
        //輔助結(jié)點(diǎn)
        Node temp = head.next;
        //循環(huán)遍歷查找
        while (true){
            //滿足條件，則是我們要找的結(jié)點(diǎn)
            if (count == (max - n + 1)){
                return temp;
            }else {
                temp = temp.next;
                count++;
            }
        }
    }

public void nodeReversal(Node head){
        //如果鏈表為空或鏈表只有一個(gè)結(jié)點(diǎn)，則不需要反轉(zhuǎn)
        if (head.next == null || head.next.next == null){
            return;
        }
        //輔助變量temp
        Node temp = head.next;
        //輔助變量temp1
        Node temp1 = null;
        //循環(huán)遍歷
        while (true){
            //退出循環(huán)的條件
            if (temp == null){
                break;
            }
            //首先將temp的下一個(gè)結(jié)點(diǎn)給temp1
            temp1 = temp.next;
            //然后將temp的next指向新鏈表頭headReversal的next（頭指向的下一個(gè)）
            temp.next = headReversal.next;
            //再然后將新鏈表頭headReversal的next指向temp結(jié)點(diǎn)
            headReversal.next = temp;
            //最后將temp1記錄的結(jié)點(diǎn)賦值給temp
            temp = temp1;
        }
        //遍歷結(jié)束，將新的順序替換原來的順序
        head.next = headReversal.next;
        //顯示鏈表，這個(gè)方法需要自己寫
        showList(head);
}