PROGRAMMING:One way linked list 2
Programming implementation: input a positive integer repeat (0 < repeat < 10), do the following operations for repeat times:
Enter a positive integer n (0 < n < = 9) and a group of integers (n) to establish a one-way linked list, and then enter an integer x to delete the last integer equal to X in the linked list.
Input and output example: description in brackets
###Input example:
```in
3 (repeat=3)
5 (number of data n = 5)
1 2 4 3 7 (5 integers)
4 (integer to be deleted x = 4)
5 (number of data n = 5)
2 1 5 7 5 (5 integers)
5 (integer to be deleted x = 5)
3 (number of data n = 3)
1 2 4 (3 integers)
100 (integer to be deleted x = 100)
```
###Output example:
```out
size=4:1 2 3 7
size=4:2 1 5 7
size=3:1 2 4
```
answer：If there is no answer, please comment
Enter a positive integer n (0 < n < = 9) and a group of integers (n) to establish a one-way linked list, and then enter an integer x to delete the last integer equal to X in the linked list.
Input and output example: description in brackets
###Input example:
```in
3 (repeat=3)
5 (number of data n = 5)
1 2 4 3 7 (5 integers)
4 (integer to be deleted x = 4)
5 (number of data n = 5)
2 1 5 7 5 (5 integers)
5 (integer to be deleted x = 5)
3 (number of data n = 3)
1 2 4 (3 integers)
100 (integer to be deleted x = 100)
```
###Output example:
```out
size=4:1 2 3 7
size=4:2 1 5 7
size=3:1 2 4
```
answer：If there is no answer, please comment