题解 | #反转链表#

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* ReverseList(ListNode* pHead) {
		ListNode*p=NULL;
		ListNode*c=pHead;
		ListNode*n=NULL;
		while(c!=NULL)
		{
			n=c->next;
			c->next=p;
			p=c;
			c=n;
		}
		pHead=p;
		return pHead;
    }
};