假設(shè)以數(shù)組sequ[m]存放循環(huán)隊(duì)列的元素鲜屏，同時(shí)設(shè)變量rear和quelen分別指示循環(huán)隊(duì)列中的隊(duì)尾元素的位置和隊(duì)列中內(nèi)含元素的個(gè)數(shù)烦感，試給出判別次循環(huán)隊(duì)列中的堆滿條件增淹，并寫出相應(yīng)的入隊(duì)和出隊(duì)的算法
(rear+1)%m == (rear-quelen+m)%m
入隊(duì)算法void EnQueue(ElemType sequ[], ElemType value)
{if((rear+1)%m == (rear-quelen+m)%m)
{printf("隊(duì)列滿!");return;
}
rear = (rear+1)%m;
sequ[rear] = value;
quelen++;
}
出隊(duì)算法void DeQueue(ElemType sequ[], ElemType *value){if(quelen == 0)
{printf("隊(duì)列空!");return;
}
*value = sequ[rear];
rear = (rear-1+m)%m;quelen--;
}
