rofn123

using System; class Deque { private const int M = 1001; private static int front; private static int rear; private static int[] data = new int[M]; public Deque() { front = rear = 0; } public bool IsEmpty() { return front == rear; } //비었는가? public void Fpush(int e) { //앞에 넣기 data[front] = e; front = (front - 1 + 1001) % 1001; } public void Rpush(int e) { //뒤에 넣기 rear = (rear + 1) % 1001; data[rea..

import java.util.Scanner; class Deque { private final static int M = 1001; private static int front; private static int rear; private static int[] data = new int[M]; public Deque(){front=rear=0;} public boolean isEmpty() {return front == rear;} //비었는가? public void fPush(int e) { //앞에 넣기 data[front] = e; front = (front-1+1001) % 1001; } public void rPush(int e) { //뒤에 넣기 rear = (rear+1) % 1001; d..

#include #define M 1001 typedef struct Deque{ int front; int rear; int data[M]; }Deque; void init(Deque* deq) {deq->front=deq->rear=0;} //초기화 int isEmpty(Deque* deq) {return deq->front == deq->rear;} //비었는가? void fPush(Deque* deq, int e) { //앞에 넣기 deq->data[deq->front] = e; deq->front = (deq->front-1+M) % M; } int fPop(Deque* deq) { //앞에서 꺼내기 deq->front = (deq->front+1) % M; return deq->data[deq..

#include class Deque { int front; int rear; int data[1001]; public: Deque(){front=rear=0;} bool isEmpty() {return front == rear;} //비었는가? void fPush(int e) { //앞에 넣기 data[front] = e; front = (front-1+1001) % 1001; } void rPush(int e) { //뒤에 넣기 rear = (rear+1) % 1001; data[rear] = e; } int fPop() { //앞에서 꺼내기 front = (front+1) % 1001; return data[front]; } int rPop() { //뒤에서 꺼내기 int tmp = data[rea..