선형덱

#include #include #define MAX_QUEUE_SIZE 100 int data[MAX_QUEUE_SIZE]; int front; int rear; void init_queue() { front = rear = 0; } void add_rear(int val) { enqueue(val); } int delete_front() { return dequeue(); } int get_front() { return peek(); } int is_empty() { return front == rear; } int is_full() { return front == (rear + 1) % MAX_QUEUE_SIZE; } int size() { return (rear - front + MAX_QUEUE..

원문링크 : 선형덱