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 JAVA (judge verdict: Memory Limit Exceeded)

import java.util.Scanner;

class Node {
	int key;
	Node prev, next;
}

class SohokoList {
	Node banpei;

	public SohokoList() {
		super();
		this.banpei = new Node();
		banpei.next = banpei;
		banpei.prev = banpei;
	}

	public void insert(int key) {
		Node x = new Node();
		x.key = key;
		// ???????????´??????????´??????????
		x.next = banpei.next;
		banpei.next.prev = x;
		banpei.next = x;
		x.prev = banpei;
	}

	public Node listSearch(int key) {
		Node cur = banpei.next;	// ??????????¬????????´????????????????
		while ( cur != banpei && cur.key != key ) {
			cur = cur.next;
		}
		return cur;
	}

	public void deleteNode(Node t) {
		if ( t == banpei ) return;	// ?????????????????????????????´?????????????????????
		t.prev.next = t.next;
		t.next.prev = t.prev;
                t = null;
	}

	public void deleteFirst() {
		deleteNode(banpei.next);
	}

	public void deleteLast() {
		deleteNode(banpei.prev);
	}

	public void deleteKey(int key) {
		deleteNode(listSearch(key));
	}

	public void print() {
		Node cur = banpei.next;
		int isf = 0;
		while(true) {
			if( cur == banpei ) break;
			if( isf++ > 0 ) System.out.print(" ");
			System.out.printf("%d", cur.key);
			cur = cur.next;
		}
		System.out.println();
	}

}

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		sc.nextLine();

		SohokoList list = new SohokoList();
		for (int i = 0; i < n; i++) {
			 String command = sc.nextLine();

			 if(command.charAt(0) == 'i') {
				 list.insert(Integer.parseInt(command.substring(7)));
			 } else if (command.charAt(6) == ' ') {
				 list.deleteKey(Integer.parseInt(command.substring(7)));
			 } else if (command.charAt(6) == 'F') {
				 list.deleteFirst();
			 } else {
				 list.deleteLast();
			 }
			command = null;

		}
		sc.close();

		list.print();

	}
}