#define debug 1
#define MaxN 1024
struct queue {
int q[MaxN];
int front;
int rear;
// initial the queue
void initial() {
front = 0;
rear = 0;
memset(q, 0, sizeof(q));
}
// judge wether the queue is empty or not
bool empty() {
return front == rear;
}
// insert an element
void push(int x) {
if (rear == MaxN) {
printf("The queue is fool !\n");
}
q[rear] = x;
++rear;
}
// delete an element
void pop() {
if (empty()) {
printf("There is no element in the queue !\n");
}
++front;
}
// look up the first element
int top() {
if (empty()) {
printf("There is no element in the queue !\n");
}
return q[front];
}
};
意思要求下单按队列去报?
看下ORDERQUEUE函数
意思要求下单按队列去报?
看下ORDERQUEUE函数