习题3.12 另类循环队列

bool AddQ(Queue Q, ElementType X){if (Q->MaxSize == Q->Count){printf("Queue Full\n");return false;}Q->Count++;Q->Data[(Q->Front+Q->Count) % (Q->MaxSize)] = X;return 0;}ElementType DeleteQ(Queue Q) {if (Q->Count == 0){printf("Queue Empty\n");return ERROR;}Q->Count--;Q->Front = (Q->Front + 1) % Q->MaxSize;return Q->Data[Q->Front];}

核心问题在于找到这个结构体如何移动指针的公式