题目描述
输入一个链表,反转链表后,输出新链表的表头
public ListNode reverseList(ListNode head) {
ListNode res = null;
ListNode curr = head;
while (curr != null){
ListNode p = curr.next;
curr.next = res;
res = curr;
curr = p;
}
return res;
}