Reverse Linked List

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) {
        //当head为null或只有一个时
        ListNode *pre=new ListNode(-1),*p;
        pre->next=head;q=pre;
        while(head&&head->next){
            p=head->next;
            head->next=p->next;
            p->next=pre->next;//这里一定不能写成p->next=head;
            pre->next=p;
        }
        return pre->next;
    }
};