1.反转链表打卡

题目：给定一个单链表的头结点pHead，长度为n，反转该链表后，返回新链表的表头。

import java.util.*;
/*
public class ListNode {
    int val;
    ListNode next = null;

    ListNode(int val) {
        this.val = val;
    }
}*/
public class Solution {
    public ListNode ReverseList(ListNode head) {
        ListNode pHead = new ListNode(-1);
        ListNode node = head;
        ListNode memo;
        while(node != null){
            memo = node.next;
            node.next = pHead.next;
            pHead.next = node;
            node = memo;
            
        }
        return pHead.next;
    }
}