反转一个单链表。
示例:
输入: 1->2->3->4->5->NULL 输出: 5->4->3->2->1->NULL
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* reverseList(struct ListNode* head){
struct ListNode* p=head;
struct ListNode* New=NULL;
if (head == NULL || head->next == NULL)
return head;
struct ListNode* temp;
while(p != NULL)
{
temp = p->next;
p->next = New;
New = p;
p = temp;
}
return New;
}