덱 (feat. 백준, 10866번)

덱
https://www.acmicpc.net/problem/10866

10866번: 덱

 

반응형

 

// woohyeon.kim
// kim519620.tistory.com
#include <iostream>
#include <deque>
#include <cstring>
using namespace std;
int main() {
	ios::sync_with_stdio(false), cin.tie(NULL);
	string str;
	deque<int> ans;
	register int N;
	cin >> N;
	for (register int n = 0, v; n < N; ++n) {
		cin >> str;
		if (!str.compare("push_front"))
			cin >> v, ans.push_front(v);
		else if (!str.compare("push_back"))
			cin >> v, ans.push_back(v);
		else if (!str.compare("pop_front"))
			if (ans.empty())
				cout << -1 << "\n";
			else
				cout << ans.front() << "\n", ans.pop_front();
		else if (!str.compare("pop_back"))
			if (ans.empty())
				cout << -1 << "\n";
			else
				cout << ans.back() << "\n", ans.pop_back();
		else if (!str.compare("size"))
			cout << ans.size() << "\n";
		else if (!str.compare("empty"))
			if (ans.empty())
				cout << 1 << "\n";
			else
				cout << 0 << "\n";
		else if (!str.compare("front"))
			if (ans.empty())
				cout << -1 << "\n";
			else
				cout << ans.front() << "\n";
		else if (!str.compare("back"))
			if (ans.empty())
				cout << -1 << "\n";
			else
				cout << ans.back() << "\n";
	}
	return 0;
}
// *&)*@*

자료구조 deque를 사용하여 문제의 요구사항대로 출력합니다.