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.util.Scanner;

// ???????????????????????¨?????????
class Node{
    int value;
    Node prev;
    Node next;

    Node(){

    }

    Node(int value){
        this.value = value;
    }
}

public class Main {

    static Node head;

    // ????§?????????¨??????????????????????????¨
    private static void init(){
        head = new Node();
        head.next = head;
        head.prev = head;
    }

    // ??¨?????¨?????´????????????
    public static void insert(int x){

        Node temp = new Node(x);
        temp.next = head.next;
        temp.prev = head;
        head.next = temp;
        temp.next.prev = temp;
    }

    //?????¨??????????????\?????°delete????????????????????°???????????¶????????????
    public static void delete(int x){

        deleteNode(listSearch(x));
    }

    public static Node listSearch(int x){
        Node cur = head.next;
        while (cur != head && cur.value != x){
            cur = cur.next;
        }
        return cur; // ??????????????????????????°?????????,?¢??????´????°??????????????´??????¨?????¨???
    }

    public static void deleteNode(Node node){

        if (node == head){
            return;
        }

        node.prev.next = node.next;
        node.next.prev = node.prev;

        // ?°?node????????¨?????????null?????\????????\?°?????????¶
        node.prev = null;
        node.next = null;
    }

    public static void deleteFirst(){
        deleteNode(head.next);
    }

    public static void deleteLast(){
        deleteNode(head.prev);
    }

    // ?????°?????¨????´????????????¨????????????????¢?
    private static void printList() {
        int count = 0;
        Node cur = head.next;
        while (cur != head){
            if (count++ > 0){
                System.out.print(" ");
            }
            System.out.print(cur.value);
            cur = cur.next;
        }
        System.out.println();
    }

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        init();

        for (int i=0; i<n; i++){
            String str = sc.next();
            if (str.equals("insert")){
                int key = sc.nextInt();
                insert(key);
            }else if (str.equals("delete")){
                int key = sc.nextInt();
                delete(key);
            }else if (str.equals("deleteFirst")){
                deleteFirst();
            }else {
                deleteLast();
            }
        }

        printList();
    }

}