题解 | #反转链表#

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

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