Problem:
Doubly Linked List

Your task is to implement a double linked list.

Write a program which performs the following operations:

insert x: insert an element with key x into the front of the list.

delete x: delete the first element which has the key of x from the list. If there is not such element, you need not do anything.

deleteFirst: delete the first element from the list.

deleteLast: delete the last element from the list.

Input

The input is given in the following format:

n

command1

command2

...

commandn

In the first line, the number of operations n is given. In the following n lines, the above mentioned operations are given in the following format:

insert x

delete x

deleteFirst

deleteLast

Output

Print all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.

Constraints

The number of operations ≤ 2,000,000

The number of delete operations ≤ 20

0 ≤ value of a key ≤ 109

The number of elements in the list does not exceed 106

For a delete, deleteFirst or deleteLast operation, there is at least one element in the list.

Sample Input 1

7
insert 5
insert 2
insert 3
insert 1
delete 3
insert 6
delete 5

Sample Output 1

6 1 2

Sample Input 2

9
insert 5
insert 2
insert 3
insert 1
delete 3
insert 6
delete 5
deleteFirst
deleteLast

Sample Output 2

1

Solution in C (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct node{
  int key;
  struct node *next, *prev;
};

typedef struct node *NodePointer;

void insert(int);
void deleteNode(NodePointer);
void delete(int);
void init(void);
void deletefirst(void);
void deletelast(void);
NodePointer finditem(int);
void listprint(void);

NodePointer head;

int main(){
  int n, i, b;
  char c[15];

  scanf("%d", &n);
  init();
  for(i = 0;i < n; i++){
    scanf("%s%d", c, &b);
    if(strcmp(c, "insert") == 0){
      insert(b);
    }
    else if(strcmp(c, "delete") == 0){
      delete(b);
    }
    else if(strcmp(c, "deleteFirst") == 0){
      deletefirst();
    }
    else if(strcmp(c, "deleteLast") == 0){
      deletelast();
    }
  }
  listprint();
  return 0;
}

void insert(int keydata){
  NodePointer x = (NodePointer)malloc(sizeof(NodePointer));

  x->key = keydata;
  x->next = head->next;
  head->next->prev = x;
  head->next = x;
  x->prev = head;
}

void listprint(){
  NodePointer n = head->next;
  int isf = 0;

  while(1){
    if(n == head) break;
    if(isf++ > 0) printf(" ");
    printf("%d", n->key);
    n = n->next;
  }
  printf("\n");
}

NodePointer finditem(int keydata){
  NodePointer n = head->next;

  while(n != head && n->key != keydata){
    n = n->next;
  }
  return n;
}

void init(){
  head = (NodePointer)malloc(sizeof(NodePointer));
  head->next = head;
  head->prev = head;
}

void deleteNode(NodePointer a){
  if(a == head) return;
  a->prev->next = a->next;
  a->next->prev = a->prev;
  free(a);
}

void delete(int keydata){
  deleteNode(finditem(keydata));
}

void deletefirst(){ 
  deleteNode(head->next);
}

void deletelast(){
  deleteNode(head->prev);
}