题解 | #反转链表#

/*
struct ListNode {
    int val;
    struct ListNode *next;
    ListNode(int x) :
            val(x), next(NULL) {
    }
};*/
class Solution {
public:
    ListNode* ReverseList(ListNode* pHead) {
        ListNode* rHead = (ListNode*)malloc(sizeof(ListNode));
        rHead->next = NULL;
        while(pHead){
            ListNode* p = new ListNode(pHead->val);
            p->next = rHead->next;
            rHead->next = p;
            pHead = pHead->next;
        }
        return rHead->next;
    }
};