反转链表
while循环实现反转链表
public ListNode reverseListNode(ListNode head)
{
ListNode now = head;
ListNode pre = null;
while(null != now)
{
ListNode next = now.next;
now.next = pre;
pre = now;
now = next;
}
return pre;
}
递归实现反转链表
public ListNode reverseListNode(ListNode head)
{
if(null == head || null == head.next)
return head;
ListNode newHead = reverseListNode(head.next);
head.next.next = head;
head.next = null;
return newHead;
}