2020-11-28

在这里插入代码片/*
public class ListNode {
    int val;
    ListNode next = null;

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