AOJ [Aizu-ALDS1_3_C]

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
command
1 
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



#include<bits/stdc++.h>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int main()
{
   list <int> L;
   int n;cin>>n;
   while(n--)
   {
        char s[100];int m;
        scanf("%s",s);  //scanf 比cin 效率高!防止超出时间限制 使用scanf
           if(s[0]=='i')
           {
               cin>>m;
               L.push_front(m);
           }else if(s[6]=='F'){
                L.pop_front();
           }else if(s[6]=='L'){
                L.pop_back();
            }else if(s[0]=='d')
            {
                cin>>m;
                for(list <int>::iterator it = L.begin();it!=L.end();it++)
                {
                    if(*it == m)
                    {
                         L.erase(it);
                         break;
                    }
                }
        }
   }
   int i = 0;
   for(list <int>::iterator it = L.begin();it!=L.end();it++)
   {
       if(i++)
        cout<<" ";
       cout<<*it;
   }
   cout<<endl;
   return 0;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Poxiao2017/article/details/79974744
文章标签: 双向链表 AOJ
个人分类: c++
上一篇PAT 1002. 写出这个数 (20)
下一篇【数据结构】C/C++ 顺序表的 创建、初始化、增、删、改、查、遍历等基本操作
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭