PROGRAMMING:Interval element deletion of JMU DS sequence table
If a linear table L is stored in a sequential storage structure, all the elements are integers. An algorithm is designed to delete all elements whose values are between [x, y]. The time complexity and space complexity of the algorithm are o (n) and O (1).
###Input format:
The first row is the number of elements in the sequence table, the second row is the elements in the sequence table, and the third row is x and y.
###Output format:
The order table after deleting all elements whose values are between [x, y].
###Input example:
ten
5 1 9 10 67 12 8 33 6 2
3 10
###Output example:
1 67 12 33 2
answer：If there is no answer, please comment
###Input format:
The first row is the number of elements in the sequence table, the second row is the elements in the sequence table, and the third row is x and y.
###Output format:
The order table after deleting all elements whose values are between [x, y].
###Input example:
ten
5 1 9 10 67 12 8 33 6 2
3 10
###Output example:
1 67 12 33 2
answer：If there is no answer, please comment