129. Delete a Value
Core1000 ms256 MBSolved by 0%
Build the list, read a value k, and remove the first node holding k.
Print the resulting list, or Empty if nothing remains. If k is not in the list, print
the list unchanged.
Constraints - `0 ≤ n ≤ 100000` - `-1000000 ≤ value, k ≤ 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.
The third line contains an integer k.
Output
Print the resulting list from head to tail on ONE line, separated by single spaces, or Empty if no nodes remain. If k is absent, print the list unchanged.
Input5
1 2 3 4 5
3
Output1 2 4 5
Noteremoves a value from the middle
Input3
1 2 3
1
Output2 3
Noteremoves the first node, which changes head
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.