反转一个单链表。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
Java
public ListNode reverseList(ListNode head) {
if (head == null || head.next == null) {
return head;
}else{
ListNode p = reverseList(head.next);
head.next.next = head;
head.next = null;
return p;
}
}