题解 | #反转链表#

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