pta双端队列

这个题有点小坑&＃xff0c;头插尾插先挪动指针还是先插入不一样&＃xff0c;当然这个双端队列是在是循环队列的基础上&＃xff0c;循环队列具体不说了。删除时&＃xff0c;头部是删除的当前指针的值&＃xff0c;而尾部删除是删除前移的值

bool Push( ElementType X, Deque D )//将元素X插入到双端队列D的头&＃xff1b;
{if((D->Rear &＃43; 1) % D->MaxSize &＃61;&＃61; D->Front)//队列满{return false;}D->Front &＃61; (D->Front &＃43; D->MaxSize - 1) % D->MaxSize;//头指针前移D->Data[D->Front] &＃61; X;//插入数据return true;}
ElementType Pop( Deque D )//删除双端队列D的头元素&＃xff0c;并返回&＃xff1b;
{if(D->Rear &＃61;&＃61; D->Front)//队列空{return ERROR;}ElementType n &＃61; D->Data[D->Front];//暂存数据D->Front &＃61; (D->Front &＃43; 1) % D->MaxSize;//头指针后移return n;}
bool Inject( ElementType X, Deque D )//将元素X插入到双端队列D的尾部
{if((D->Rear &＃43; 1) % D->MaxSize &＃61;&＃61; D->Front)//队列满{return false;}D->Data[D->Rear] &＃61; X;//插入XD->Rear &＃61; (D->Rear &＃43; 1) % D->MaxSize;//尾指针后移return true;}
ElementType Eject( Deque D )//删除双端队列D的尾部元素&＃xff0c;并返回
{if(D->Rear &＃61;&＃61; D->Front)//队列空{return ERROR;}else{D->Rear &＃61; (D->Rear &＃43; D->MaxSize-1 ) % D->MaxSize;//尾指针前移return D->Data[D->Rear];//返回值}
}