C - Doubly Linked List Aizu - ALDS1_3_C

#include <bits/stdc++.h>

#define INF 0x3f3f3f3f
#define eps 1e-6

typedef long long LL;
const double pi = acos(-1.0);
const long long mod = 1e9;
using namespace std;

string name;
list<int> l;
int N,q;

int main()
{
    //ios_base::sync_with_stdio(false); cin.tie(0);
    //freopen("int.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    cin >> N;
    for(int i = 0; i < N; i++)
    {
        cin >> name;
        if(name == "insert")
        {
            cin >> q;
            l.push_front(q);
        }
        else if(name == "delete")
        {
            cin >> q;
            for(list<int>::iterator it = l.begin(); it != l.end(); it++)
                if(*it == q)
                {
                    l.erase(it);
                    break;
                }
        }
        else if(name == "deleteFirst")
            l.pop_front();
        else if(name == "deleteLast")
            l.pop_back();
    }
    int i = 0;
    for(list<int>::iterator it = l.begin(); it != l.end(); it++)
    {
        if(i++)
            printf(" ");
        printf("%d",*it);
    }
    puts("");
    return 0;
}

#include <bits/stdc++.h>

#define INF 0x3f3f3f3f
#define eps 1e-6

typedef long long LL;
const double pi = acos(-1.0);
const long long mod = 1e9;
using namespace std;

struct Node
{
    int key;
    Node *next, *prev;
};

Node *nil;

Node* listSearch(int key)
{
    Node *cur = nil->next;
    while(cur != nil && cur->key != key)
        cur = cur->next;
    return cur;
}
void init()
{
    nil = (Node *)malloc(sizeof(Node));
    nil->next = nil;
    nil->prev = nil;
}

void printfList()
{
    Node *cur = nil->next;
    int isf = 0;
    while(1)
    {
        if(cur == nil)
            break;
        if(isf++ > 0)
            printf(" ");
        printf("%d",cur->key);
        cur = cur->next;
    }
    puts("");
}

void deleteNode(Node *t)
{
    if(t == nil)
        return;
    t->prev->next = t->next;
    t->next->prev = t->prev;
    free(t);
}

void deleteLast()
{
    deleteNode(nil->prev);
}

void deleteFirst()
{
    deleteNode(nil->next);
}

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

void Insert(int key)
{
    Node *x = (Node *)malloc(sizeof(Node));
    x->key = key;
    x->next = nil->next;
    nil->next->prev = x;
    nil->next = x;
    x->prev = nil;
}

int main()
{
    //ios_base::sync_with_stdio(false); cin.tie(0);
    //freopen("int.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int key, n;
    int Size = 0;
    string s;
    int np = 0,nd = 0;
    cin >> n;
    init();
    for(int i = 0;i < n;i++)
    {
        cin >> s;
        if(s == "insert")
        {
            cin >> key;
            Insert(key);
            np++;
            Size++;
        }
        else if(s[0] == 'd')
        {
            if(s == "deleteFirst")
                deleteFirst();
            else if(s == "deleteLast")
                deleteLast();
            else
            {
                cin >> key;
                deleteKey(key);
                nd++;
            }
            Size--;
        }
    }
    printfList();
    return 0;
}