Remove the last X
Given a linked list, you are asked to remove the last element in the list that’s equal to
X. In case the linked list does not contain X, the link list should stay untouched.Input
The initial data for the linked list is obtained automatically. You don’t need to do anything. It’s guaranteed that the size of the linked list does exceed and the values in the linked list don’t exceed in their absolute value.
Output
The data of the linked list is printed automatically. You don’t need to do anything.
Examples
Input | Output |
5 1
4 1 1 3 1 | 4 1 1 3 |
5 3
4 1 1 3 1 | 4 1 1 1 |
3 2
4 4 3 | 4 4 3 |
Constraints
Time limit: 1 seconds
Memory limit: 512 MB
Output limit: 1 MB