Skip to content
6
0
:
0
0

Backtrack Navigation Chain

Easy

Linked List

In "Backtrack Navigation Chain", a singly linked sequence is represented as an array in input order.

Return the sequence in reversed order as if the linked list pointers were fully reversed.

Example 1

Input:head = [4,5,6,7,8]
Output:[8,7,6,5,4]

For input head = [4,5,6,7,8], reversing the node direction makes the values appear in reverse order, so the output is [8,7,6,5,4]. Therefore, return [8,7,6,5,4].

Example 2

Input:head = [8,9,10,11]
Output:[11,10,9,8]

For input head = [8,9,10,11], reversing the node direction makes the values appear in reverse order, so the output is [11,10,9,8]. Therefore, return [11,10,9,8].

Constraints

  • 0 <= head.length <= 5000
  • -5000 <= head[i] <= 5000
solution.js
Loading...

Test Cases (2)

Test Case 1
Input:
[4,5,6,7,8]
Expected Output:
[8,7,6,5,4]
Test Case 2
Input:
[8,9,10,11]
Expected Output:
[11,10,9,8]