题解 | #反转链表#

/*
struct ListNode {
	int val;
	struct ListNode *next;
	ListNode(int x) :
			val(x), next(NULL) {
	}
};*/
class Solution {
public:
    ListNode* ReverseList(ListNode* pHead) {
		if(pHead == nullptr)
			return pHead;
		ListNode *curr = pHead;
		ListNode *pre = nullptr;
		while(curr)
		{
			ListNode *temp = curr->next;
			curr->next = pre;
			pre = curr;
			curr = temp;
		}
		return pre;
    }
};