题解 | #反转链表#

/*
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 nullptr;
        ListNode* pre = pHead;
        ListNode* cur = pHead->next;
		pre->next=nullptr;
		pHead = pre;
        while (cur)
		{
            pre= cur;
            cur=cur->next;
			pre->next = pHead;
			pHead = pre;
        }

		return pHead;
    }
};

头插法实现链表的逆置