Leetcode之 Reverse Linked List

题目：

Reverse a singly linked list.

Example:

Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL

Follow up:

A linked list can be reversed either iteratively or recursively. Could you implement both?

代码：

方法一——：
 

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if(!head)return NULL;
        ListNode* first = new ListNode(0);
	first->next = head;
	ListNode* p = first->next;
	while (p->next) {
		ListNode* temp = p->next->next;
		p->next->next = first->next;
		first->next = p->next;
		p->next = temp;
	}
	return first->next;
    }
};

方法二——递归：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if (!head)return NULL;
	if (!head->next)return head;

	ListNode* res = reverseList(head->next);
	ListNode* p = res;
	while (p->next) {
		p = p->next;
	}
	p->next = head;
	head->next = NULL;
	return res;
    }
};

想法：

考虑临界情况