[leetcode]206. Reverse Linked List

Reverse a singly linked list.

/**
 * 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) {
        ListNode tmp(-1);
        tmp.next = head;
        
        vector<int> data;
        while(head!=NULL)
        {
            data.insert(data.begin(),head->val);
            head = head->next;
        }
        head = tmp.next;
        for(int i=0; i<data.size();i++)
        {
            head->val = data[i];
            head = head->next;
        }
        return tmp.next;
    }
};