lc 反转链表

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* reverseList(ListNode* head) {
        if(head == nullptr) return nullptr;
        ListNode* cur = head;
        ListNode* ret = nullptr;
        while(cur) {
            if(ret == nullptr) {
                ListNode* temp = new ListNode(cur->val);
                ret = temp;
                cout << cur->val << endl;
            }
            else {
                ListNode* temp = new ListNode(cur->val);
                temp->next = ret;
                ret = temp;
                cout << cur->val << endl;
            }
            cur = cur->next;
        }
        return ret;
    }
};