Reverse a singly linked list.
/**
* 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 || head->next == NULL)
return head;
ListNode* curNode = head->next;
ListNode* preNode = head;
preNode->next = NULL;
ListNode* temp = NULL;
while(curNode != NULL){
temp = curNode->next;
curNode->next = preNode;
preNode = curNode;
curNode = temp;
}
return preNode;
}
};