【数据结构练·JAVA】反转一个单链表

public Node reverseList(){
            Node cur = this.head;//定义 cur 指向头结点
            Node pre = null;
            Node reverseHead = null;//reverseHead 为逆置后的头结点
            //使用 cur 遍历整个链表
            while(cur != null){
                Node curNext = cur.next;
                //最后一个节点的逆置
                if (curNext == null){
                    reverseHead = cur;//逆置前最后一个节点为逆置后头结点
                }
                //中间节点的逆置
                cur.next = pre;
                pre = cur;
                cur = curNext;
            }
            return reverseHead;
        }
//打印函数
public void show(Node revList){
            Node cur = revList;
            while(cur != null) {
                System.out.print(cur.data+" ");
                cur = cur.next;
            }
            System.out.println();
        }