LeetCode *** 206. Reverse 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)return NULL;

ListNode* tail=NULL;
ListNode* tmpHead=head;

while(tmpHead!=NULL){
ListNode *tmp=new ListNode(tmpHead->val);
tmp->next=tail;
tail=tmp;
tmpHead=tmpHead->next;
}

return tail;
}
};