示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
解题思路:
构造一个新的头结点指向NULL,反转链表就让每一个从前向后插入即可
typedef struct ListNode ListNode;
struct ListNode* reverseList(struct ListNode* head){
ListNode* newhead = NULL;
ListNode* cur = head;
while(cur)
{
ListNode* next = cur->next;
cur->next = newhead;
newhead = cur;
cur = next;
}
return newhead;
}