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: Time Limit Exceeded)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main{


	public static void main(String[] args){

		BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
		String str;
		String[] array=new String[2];
		int num;

		LinkedList list=new LinkedList();
		try{
		int n=Integer.parseInt(reader.readLine());
		num=-1;

		for(int i=0;i<n;i++){
			str=reader.readLine();
			if(str.equals("deleteFirst")||str.equals("deleteLast")){
				array[0]=str;
				}else{array=str.split(" ");
				num=Integer.parseInt(array[1]);
					}


			switch(array[0]){
			case "insert":
				list.insert(num);
				break;
			case "delete":
				list.delete(num);
				break;
			case "deleteFirst":
				list.deleteFirst();
				break;
			case "deleteLast":
				list.deleteLast();
				break;
			default:
				break;
			}
		}

		list.outputAll();

		}catch(IOException e){

		}



	}//main
}

class LinkedList{

	static class Node{
		int data;
		Node prev;
		Node next;

		Node(int data, Node prev, Node next){
			this.data=data;
			this.prev=prev;
			this.next=next;
		}
	}

	Node ptr, head;

	LinkedList(){
		head=null;
	}

	void insert(int num){
		ptr=head;
		head=new Node(num, null, ptr);
		if(ptr!=null)ptr.prev=head;
	}

	void delete(int num){
		ptr=head;
		int cnt=0;
		while(ptr!=null){
			if(ptr.data==num){
				//??????
				cnt++;
				if(ptr.next==null&&ptr.prev==null)head=null;
			    else if(ptr.prev==null)deleteFirst();
				else if(ptr.next==null)deleteLast();
				else{
				Node Prev=ptr.prev;
				Node Next=ptr.next;
				Prev.next=ptr.next;
				Next.prev=ptr.prev;
				}
				break;
			}
			if(cnt==1)break;
			ptr=ptr.next;
		}

	}

	void deleteFirst(){
		if(head.next==null)head=null;//???????????????????????¨????????\??????
		else{
		ptr=head;
		head=ptr.next;
		head.prev=null;
		}
	}

	void deleteLast(){
		if(head.next==null)head=null;//?????????????????????????????\??????
		else{
		ptr=head;
		while(ptr.next!=null){
			ptr=ptr.next;
		}
		ptr=ptr.prev;
		ptr.next=null;
		}

	}

	void outputAll(){
		ptr=head;
		while(ptr.next!=null){
			System.out.print(ptr.data+" ");
			ptr=ptr.next;

		}System.out.println(ptr.data);
	}

}