反转链表输出

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* ReverseList(ListNode* head) {
		if(head==NULL)
            return NULL;
        ListNode *p,*q,*t;
        p=NULL;
        q=head;
        t=head->next;
        while(q!=NULL){
            q->next=p;
            p=q;
            q=t;
            t=t->next;
        }
        return p;
    }
};