121. Build and Print a Linked List
Foundation1000 ms256 MBSolved by 0%
Read n and then n values, build a linked list from them in order, and
print the values separated by single spaces.
If the list is empty, print Empty.
This is the shape every problem in this topic uses: the values arrive as numbers, you build the list, and you walk it with a pointer.
Constraints - `0 ≤ n ≤ 100000` - `-1000000 ≤ value ≤ 1000000`
Input
The first line contains an integer n, the number of nodes.
The second line contains n space-separated integers, the node values from head to tail.
The starter code builds the list for you; work on the nodes, not the array.
Output
Print the node values from head to tail on ONE line, separated by single spaces, or Empty if the list has no nodes.
Input5
1 2 3 4 5
Output1 2 3 4 5
Noteis an ordinary list
Input0
OutputEmpty
Noteis an empty list, where head is null and the walk must not start
Hints
Four rungs, in order. The last two open once you have submitted an attempt. A wrong one counts.
Hint 1Where to start
Hint 2The approachOpen hint 1 first. This one carries on from it.
Hint 3PseudocodeOpen hint 2 first. This one carries on from it.
Hint 4Full solutionOpen hint 3 first. This one carries on from it.