LintCode 翻转链表

/**
* Definition of ListNode
*
* class ListNode {
* public:
*     int val;
*     ListNode *next;
*
*     ListNode(int val) {
*         this->val = val;
*         this->next = NULL;
*     }
* }
*/
class Solution {
public:
/**
* @param head: The first node of linked list.
* @return: The new head of reversed linked list.
*/
ListNode *reverse(ListNode *head) {
// write your code here
ListNode *r,*f;
r=new ListNode(0);
while(head!=NULL)
{
f=new ListNode(head->val);
f->next=r->next;
r->next=f;
head=head->next;
}
return r->next;
}
};