Implement the "deque" data structure. Write a program that describes the deque and simulates its operations. You must implement all methods given below. The program reads the sequence of commands and executes the corresponding operation. After executing each command the program must print one line. The possible commands for the program are:
Add (put) into the front of the deque the new element. The program must print ok.
Add (put) into the end of the deque the new element. The program must printok.
Pop the first element from the deque. The program must print its value.
Pop the last element from the deque. The program must print its value.
Find the value of the first element (not deleting it). The program must print its value.
Find the value of the last element (not deleting it).The program must print its value
Print the number of elements in the deque.
Clear the deque (delete all its elements) and print ok.
The program must print bye and terminate.
It is guaranteed that the number of elements in the deque at any time does not exceed 100. All the operations:
are usually correct.
Given in the problem statement. Look at sample input.
Given in the problem statement.Look at sample output.
push_back 3 push_front 14 size clear push_front 1 back push_back 2 front pop_back size pop_front size exit
ok ok 2 ok ok 1 ok 1 2 1 1 0 bye
Example description: Количество элементов во всех структурах данных не превышает 10000, если это не указано особо.