LeetCode Reverse Linked List


Reverse a singly linked list.

The original problem is here.

The original code is here.

My Solution

I solve this problem in C++, as below:

*Reverse Linked List 
*Author: shuaijiang
*Email: zhaoshuaijiang8@gmail.com
using namespace std;

 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
class Solution {
    ListNode* reverseList(ListNode* head) {
        if(head == NULL) 
            return NULL;
        ListNode *newList=NULL;
        ListNode *currentNode=head;
        while(currentNode != NULL)
            int val = currentNode->val;
            currentNode = currentNode->next;
            ListNode *newNode = new ListNode(val);
            newNode->val  = val;
            newNode->next = newList;
            newList = newNode;
        return newList;


To solve the problem, we traverse the list and create a new list which add elements at the begining of the new list.