[문제풀이] 5397번: 키로거

[문제풀이] 5397번: 키로거

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

문제유형

연결리스트

Solution

#include <cstdio>
 
struct NODE
{
    char ch;
    struct NODE* next;
    struct NODE* prev;
};
 
NODE HEAD;
NODE TAIL;
NODE* head = &HEAD;
NODE* tail = &TAIL;
NODE* cur = &HEAD;
 
int T;
char str[1000000];
 
void init()
{
    HEAD.ch = -1;
    HEAD.next = NULL;
    HEAD.prev = NULL;
    TAIL = HEAD;
 
    head = &HEAD;
    head->next = tail;
    tail = &TAIL;
    tail->prev = head;
 
    cur = head;
 
    for (register int i = 0; str[i] != 0; i++) str[i] = 0;
}
 
void insertNode(char ch)
{
    NODE* p = new NODE;
    p->ch = ch;
 
    p->next = cur->next;
    p->prev = cur;
    cur->next->prev = p;
    cur->next = p;
 
    cur = cur->next;
}
 
void deleteNode()
{
    NODE* del = cur;
 
    if (cur == &HEAD) return;
 
    cur->prev->next = cur->next;
    cur->next->prev = cur->prev;
    cur = cur->prev;
 
    delete del;
}
 
void curToRight()
{
    if (cur->next->next == NULL) return;
 
    cur = cur->next;
}
 
void curToLeft()
{
    if (cur->prev == NULL) return;
 
    cur = cur->prev;
}
 
void print()
{
    head = head->next;
 
    for (;;)
    {
        if (head == tail) return;
 
        printf("%c", head->ch);
 
        head = head->next;
    }
    
}
 
void solve(char* str)
{
    do
    {
        if (*str == '-')
        {
            deleteNode();
        }
        else if (*str == '<')
        {
            curToLeft();
        }
        else if (*str == '>')
        {
            curToRight();
        }
        else
        {
            insertNode(*str);
        }
        str++;
    } while (*str != '\0');
}
 
 
int main()
{
    scanf("%d", &T);
 
    while (T--)
    {
        init();
        scanf("%s", str);
        solve(str);
        print();
        printf("\n");
    }
 
    return 0;
}