bool AddQ( Queue Q, ElementType X ){
if(Q->Count == Q->MaxSize){
printf("Queue Full\n");
return false;
}
Q->Count++;
Q->Data[(Q->Front + Q->Count) % Q->MaxSize] = X;
return true;
}
ElementType DeleteQ( Queue Q ){
if(Q->Count==0){
printf("Queue Empty\n");
return ERROR;
}else{
Q->Count--;
Q->Front=(Q->Front + 1)% Q->MaxSize;
return Q->Data[Q->Front];
}
}
3-3 另类循环队列
最新推荐文章于 2024-06-14 15:02:13 发布