[문제풀이] 1406번: 에디터

[문제풀이] 1406번: 에디터

https://www.acmicpc.net/problem/1406

문제유형

연결리스트

Solution

#include <cstdio>
 
struct NODE
{
    char ch;
    NODE* next;
    NODE* prev;
};
 
NODE HEAD;
NODE TAIL;
NODE* cur;
 
char str[100001];
 
void init()
{
    HEAD.next = &TAIL;
    HEAD.prev = NULL;
    TAIL.next = NULL;
    TAIL.prev = &HEAD;
 
    cur = &TAIL;
}
 
void insertNode(char ch)
{
    NODE* p = new NODE;
    p->ch = ch;
 
    p->next = cur;
    p->prev = cur->prev;
    cur->prev->next = p;
    cur->prev = p;
}
 
void deleteNode()
{
    NODE* del = cur->prev;
    if (del == &HEAD) return;
 
    cur->prev->prev->next = cur;
    cur->prev = cur->prev->prev;
 
    delete del;
}
 
void curLeft()
{
    if (cur->prev->prev == NULL) return;
    cur = cur->prev;
}
 
void curRight()
{
    if (cur->next == NULL) return;
    cur = cur->next;
}
 
void print()
{
    NODE* head = &HEAD;
    head = head->next;
 
    for (;;)
    {
        if (head->next == NULL) break;
 
        printf("%c", head->ch);
 
        head = head->next;
    }
}
 
int main()
{
    int i;
    int N = 0;
    char ch = 0;
 
    init();
 
    scanf("%s", str);
    for (i = 0; str[i] != 0; i++)
    {
        insertNode(str[i]);
    }
 
    scanf("%d", &N);
    for (i = 0; i < N; i++)
    {
        scanf(" %c", &ch);
        if (ch == 'L')
        {
            curLeft();
        }
        else if (ch == 'D')
        {
            curRight();
        }
        else if (ch == 'B')
        {
            deleteNode();
        }
        else if (ch == 'P')
        {
            scanf("  %c", &ch);
            insertNode(ch);
        }
    }
 
    print();
    printf("\n");
 
    return 0;
}