Leetcode 206 Reverse linked list
struct ListNode
{
int val;
ListNode* next;
ListNode(int x):val(x),next(NULL){}
};
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(!head || !head->next)
return head;
ListNode *newHead;
ListNode *pre = nullptr,*next = nullptr;
newHead = head;
while(newHead->next){
next = newHead->next;
newHead->next = pre;
pre = newHead;
newHead = next;
}
//tail
newHead->next = pre;
return newHead;
}
};