题解 | #反转链表#

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* ReverseList(ListNode* pHead) {
		ListNode *pre = nullptr; //尾结点的next要指向null
		ListNode *cur = pHead;	
		while (cur!=nullptr) {
			ListNode *cur_next = cur->next;
			cur->next = pre;
			pre = cur;
			cur = cur_next;
		}
		pHead = pre;
		return pHead;
    }
};