反转一个单链表。
- 示例:
输入: 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) {
ListNode *node1, *node2=NULL;
while(head) {
node1 = head;
head = head->next;
node1->next=node2;
node2 = node1;
}
return node2;
}
};