qq_62815538的博客

原创 队列的顺序实现

目录一，队列的顺序实现#define MaxSize 10typedef struct { ElemType data[MaxSize]; int front, rear;}SqQueue;二，循环队列1）初始化void InitQueue(SeQueue &Q){ Q.front = Q.rear = 0;}2）判队空bool isEmpty(SqQueue Q){ if (Q.front == Q.rear) return true; return