反转一个单链表。
示例:
输入: 1->2->3->4->5->NULL
输出: 5->4->3->2->1->NULL
/**
* 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 == NULL)
return NULL;
ListNode *node = head;
vector<int>a;
int n = 0;
while(head != NULL){
a.emplace_back(head->val);
head = head->next;
n++;
}
head = node;
for(int i = n-1;i>=0;i--){
node->val = a[i];
node = node->next;
}
return head;
}
};