leetcode_c++：链表：Reverse Linked Lis(206)

class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(head==NULL||head->next==NULL)
return head;

ListNode* dummy=new ListNode(-1);
dummy->next=head;

ListNode* prev=head,*cur=head->next;

while(cur){
prev->next=cur->next;
cur->next=dummy->next;
dummy->next=cur;
cur=prev->next;
}
return dummy->next;

}
};