[백준 5397번] 키로거

소스코드

---

#include <iostream>
using namespace std;
 
char left_word[1000001], right_word[1000001];
int left_sp = 0, right_sp = 0;
 
void push_left(char a) {
    left_word[left_sp++] = a;
}
void push_right(char a) {
    right_word[right_sp++] = a;
}
char pop_left() {
    return left_word[--left_sp];
}
char pop_right() {
    return right_word[--right_sp];
}
 
int main() {
    int n;
    cin >> n;
    while (n > 0) {
        n--;
        char word[1000001];
        cin >> word;
        int idx = 0;
        left_sp = 0;
        right_sp = 0;
        while (word[idx] != NULL) {
            if (word[idx] == '<') {
                if (left_sp > 0) {
                    push_right(pop_left());
                }
            }
            else if (word[idx] == '>') {
                if (right_sp > 0) {
                    push_left(pop_right());
                }
            }
            else if (word[idx] == '-') {
                if (left_sp > 0) {
                    pop_left();
                }
            }
            else {
                push_left(word[idx]);
            }
            idx++;
        }
        for (int i = 0; i < left_sp; i++) {
            cout << left_word[i];
        }
        for (int i = right_sp-1; i >=0; i--) {
            cout << right_word[i];
        }
        cout << '\n';
    }
 
    
    return 0;
}