Cerinta completa

This challenge is part of a tutorial track by MyCodeSchool and is accompanied by a video lesson.

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty.

Example
references the list

Manipulate the pointers of each node in place and return , now referencing the head of the list .

Function Description

Complete the reverse function in the editor below.

reverse has the following parameter:

  • SinglyLinkedListNode pointer head: a reference to the head of a list

Returns

  • SinglyLinkedListNode pointer: a reference to the head of the reversed list

Input Format

The first line contains an integer , the number of test cases.

Each test case has the following format:

The first line contains an integer , the number of elements in the linked list.
Each of the next lines contains an integer, the values of the elements in the linked list.

Constraints

  • , where is the element in the list.

Sample Input

1
5
1
2
3
4
5

Sample Output

5 4 3 2 1

Explanation

The initial linked list is: .

The reversed linked list is: .

Limbajul de programare folosit: cpp14

Cod:

SinglyLinkedListNode* reverse(SinglyLinkedListNode* llist) {
    SinglyLinkedListNode* prev = nullptr;
    SinglyLinkedListNode* cur = llist;
    while (cur) {
        SinglyLinkedListNode* nxt = cur->next;
        cur->next = prev;
        prev = cur;
        cur = nxt;
    }
    return prev;
}

Scor obtinut: 1.0

Submission ID: 464654481

Link challenge: https://www.hackerrank.com/challenges/reverse-a-linked-list/problem

Reverse a linked list