(链表练习)反转一个单链表---数据结构

示例：
输入：1->2->3->4->5->null
输出：5->4->3->2->1->null
实现：

package pracLinkedList;

public class ReverseList {
    public static void main(String[] args) {
        ListNode n1=new ListNode(1);
        ListNode n2=new ListNode(2);
        ListNode n3=new ListNode(3);
        ListNode n4=new ListNode(4);
        ListNode n5=new ListNode(5);
        ListNode head=n1;
        n1.next=n2;
        n2.next=n3;
        n3.next=n4;
        n4.next=null;
        System.out.println("原链表的值");
        print(head,head.val);
        ListNode node1 = reverseList(head);
        System.out.println("反转后的链表值");
        print(node1,node1.val);
    }
    public static ListNode reverseList(ListNode head){
       ListNode pre=null;
       ListNode cur=head;
       while (cur!=null){
           ListNode next=cur.next;
           cur.next=pre;
           pre=cur;
           cur=next;
       }
       return pre;
    }
    public static void print(ListNode head,int var){
        ListNode cur=head;
        while (cur!=null){
            System.out.println(cur.toString());
            //System.out.println(cur.val);
            cur=cur.next;
        }
    }
}

执行结果：