Queue/CircularQueue.c
int deQueue(Queue* Q) {
    if (isEmpty(Q)) {
        return -1;
    } else {
        int data = Q->data[Q->front];
        Q->front = (Q->front + 1) % MAXSIZE;
        return data;
    }
}
/**
 * dequeue
 * @param Q the pointer of queue
 * @return the data you want to dequeue
 */
dequeue
@param Q the pointer of queue
@return the data you want to dequeue
dequeue @param Q the pointer of queue @return the data you want to dequeue
int deQueue(Queue* Q) {
    if (isEmpty(Q)) {
        return -1;
    } else {
        int data = Q->data[Q->front];
        Q->front = (Q->front + 1) % MAXSIZE;
        return data;
    }
}
int deQueue ( Queue * Q ) { if ( isEmpty ( Q ) ) { return -1 ; } else { int data = Q -> data [ Q -> front ] ; Q -> front = ( Q -> front + 1 ) % MAXSIZE ; return data ; } }
dequeue
 @param Q the pointer of queue
 @return the data you want to dequeue
dequeue @param Q the pointer of queue @return the data you want to dequeue