백준 1406번 에디터 C++

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

 

중간 삽입 삭제가 O(1)인 연결 리스트를 이용하였다.

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using ll = long long;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	list<char> lst;
	string str;
	cin >> str;
	for (int i = 0; i < str.length(); i++) {
		lst.push_back(str[i]);
	}
	auto cursor = lst.end();

	int m;
	cin >> m;

	for (int i = 0; i < m; i++) {
		char order;
		cin >> order;
		if (order == 'P') {
			char c;
			cin >> c;
			cursor = lst.insert(cursor, c);
			++cursor;
		}
		else if (order == 'L') {
			if (cursor == lst.begin()) continue;
			--cursor;
		}
		else if (order == 'D') {
			if (cursor == lst.end()) continue;
			++cursor;
		}
		else if (order == 'B') {
			if (cursor == lst.begin()) continue;
			auto nextCursor = cursor;
			--nextCursor;
			cursor = lst.erase(nextCursor);
		}
	}
	for (auto a : lst) {
		cout << a;
	}
};