题解 | #反转链表#

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

}

};