[C++] 백준 10866

문제 소스 코드 #include #include #include using namespace std; vector Deque; void push_front(int num) { Deque.insert(Deque.begin(),num); } void push_back(int num) { Deque.push_back(num); } int size() { return Deque.size(); } int pop_front() { if(size() == 0) return -1; int result = Deque[0]; Deque.erase(Deque.begin()); return result; } int pop_back() { if(size() == 0) return -1; int result = Deque[Deque.size()-1]; Deque.pop_back(); return result; } int front() { if(s...