题解 | #反转链表#

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* ReverseList(ListNode* pHead) {//双指针
		ListNode* cur = pHead;
		ListNode* nxt = NULL;
		ListNode* tmp;
		while(cur){
			tmp = cur->next;
			cur->next = nxt;
			nxt = cur;
			cur = tmp;
		}
		return nxt ;

    }
};