题解 | #反转链表#

/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode ReverseList(ListNode head) {
        ListNode newListNode=null;
        while(head!=null){
            ListNode tempNode = head.next;
            head.next=newListNode;
            newListNode=head;
            head=tempNode;
        }
        return newListNode;
    }
}