Given a link list structure named Node.
In this problem, you need to implement two operation for the linked list.
func1: Node* createList(int *a, int size);
func2: void deleteElementByIdx(Node** head, int idx);
func1: using an array to build the link list
func2: delete the element by its index (begin from 0)
ex: origin linked list : [0, 1, 2, 3], when call the function deleteElementByIdx(&head, 0). the final linked list will be [1,2,3]
note that: if the idx out of range. you should ignore the delete operation
T M
S1 .. SM
del0_idx
...
delT_idx
T: the number of command ( 0 < T <= 200)
M: the number of initial linked size (0 <= M <= 2000)
Si: the value of the initial array (0 <= Si <= 1000)
Output the element in linked list whenever the operation be called.