输入一个链表,反转链表后,输出新链表的表头。
//
public class Solution {
public ListNode ReverseList(ListNode head) {
ListNode curr = head;
ListNode prev = null;
ListNode next = null;
while (curr != null) {
next = curr.next;
curr.next = prev;
prev = curr;
curr = next;
}
return prev;
}
}