Problem 2657 --Elementary data structures - Doubly Linked List

2657: Elementary data structures - Doubly Linked List

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $25$ 正确数量 $8$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL

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.

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

Print all the element (key) in the list after the given operations. Two consequtive keys should be separated by a single space.
7
insert 5
insert 2
insert 3
insert 1
delete 3
insert 6
delete 5
6 1 2

The number of operations ≤ 2,000,000 

The number of delete operations ≤ 20

0 ≤ value of a key ≤ 10^9 

The number of elements in the list does not exceed 10^6

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

推荐代码 查看2657 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$287 $ms] 计爱玲 430994 2019-05-20 16:26:57
内存最少[$2028 $KB] beholder 779436 2021-11-15 01:13:20
第一AC AOJ大管家 338583 2018-12-05 21:35:39
第一挑战 卑微小赵 286187 2018-10-13 09:36:51

赛题来源/所属竞赛 会津大学《挑战数据结构与算法》 挑战数据结构与算法

竞赛编号 竞赛名称 竞赛时间 访问比赛