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