单向链表 反转链表 java实现

//节点结构
public class Node {

    int data;
    Node next;
    Node(int data){
        this.data =data;
        next = null;
    }

    @Override
    public String toString() {
        return "Node{" +
                "data=" + data +
                '}';
    }
}

//单向链表
public class NodeList {

    Node head = new Node(0);

    void addNode(Node node) {
        Node temp = head;
        while (temp.next != null) {
            temp = temp.next;
        }
        temp.next = node;
    }

    void showList() {
        Node temp = head.next;
        if (temp == null) {
            System.out.println("链表为空！！！");
        } else {
            while (temp != null) {
                System.out.println(temp.data);
                temp = temp.next;
            }
        }
    }

    void insertNode(Node node,int pos)
    {
        Node temp = head;
        for (int i =1;i < pos;i++)
        {
            temp = temp.next;
        }
        Node tempNext = temp.next;
        temp.next = node;
        node.next = tempNext;
    }
    void delNode(int pos)
    {
        Node temp =head;
        for (int i = 1 ; i< pos;i++)
        {
            temp = temp.next;
            if (temp ==null)
            {
                System.out.println("指定位置超过链表长度");
                return;
            }
        }
        Node nextTemp = temp.next;//nextTemp即为要删除的节点
        if (nextTemp.next ==null)
        {
            temp.next =null;
        }
        else {
            temp.next = nextTemp.next;
        }
        }
    void updateNode(int newData,int pos)
    {
        Node temp =head;
        for (int i = 1 ; i< pos;i++)
        {
            temp = temp.next;
            if (temp ==null)
            {
                System.out.println("指定位置超过链表长度");
                return;
            }
        }
        temp.next.data = newData;
    }
    int getNodeCount(){
        int count =0;
        Node temp = head.next;
        if (temp == null) {
            System.out.println("链表为空！！！");
        } else {
            while (temp != null) {
                count++;
                temp = temp.next;
            }
        }
        return count;
    }
//输出倒数第k节点的值
    Node getKNode(int k)
    {
        Node aim = head;
        if (k > getNodeCount())
        {
            System.out.println("k超过链表长度");
            return null;
        }
        else {
            int pos = getNodeCount() - k + 1;

            for (int i =1;i < pos ;i++)
            {
                aim = aim.next;
            }
        }
        return aim.next;
        }


}

//反转链表
public class reverseList {

    Node head = new Node(0);
    Node reverseHead = new Node(0);
    void addNode(Node node) {
        Node temp = head;
        while (temp.next != null) {
            temp = temp.next;
        }
        temp.next = node;
    }
//反转链表
    void reverseNode()
    {
     Node temp = head.next;

     while (temp!= null)
     {
            Node next = temp.next;
            temp.next = reverseHead.next;
            reverseHead.next = temp;
            temp = next;
     }
     head.next = reverseHead.next;
    }
    void showList() {
        Node temp = head.next;
        if (temp == null) {
            System.out.println("链表为空！！！");
        } else {
            while (temp != null) {
                System.out.println(temp.data);
                temp = temp.next;
            }
        }
    }
//递归倒序输出链表的值
    void showListReversely(Node node){
        if (node != null)
        {
            showListReversely(node.next);
            System.out.println(node.data);

        }

    }
   
}