队列的基本操作(个人学习归纳)

Status InitQueue(SqQueue &Q) //初始化队列
{
	Q.base = (QElemType *)malloc((MAXQSIZE)*sizeof(QElemType));
	if(!Q.base) return OVERFLOW;
	Q.front=Q.rear = 0;
	return OK;
}

Status ClearQueue(SqQueue &Q)  //清空队列
{
	Q.front=Q.rear = 0;
	return OK;
}

Status QueueLength(SqQueue Q)  //计算队列长度
{
	if(Q.rear>=Q.front) return Q.rear - Q.front;
	else return Q.rear - Q.front + MAXQSIZE ;
}

Status EnQueue(SqQueue &Q,QElemType e)  入队
{
	if ((Q.rear+1)%MAXQSIZE==Q.front) return ERROR;
	Q.base[Q.rear]=e;
	Q.rear = (Q.rear+1)%MAXQSIZE;
	return OK;
}

Status DeQueue(SqQueue &Q,QElemType &e)  出队
{
	if(Q.front == Q.rear) return ERROR;
	e = Q.base[Q.front];
	Q.front = (Q.front+1)%MAXQSIZE;
	return OK;
	
}

个人学习总结,可能很多地方写的不对

猜你喜欢

转载自blog.csdn.net/m0_46827210/article/details/105594670