题解 | #反转链表#

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