隊列的順序儲存表示---數組實現

標籤：

#define MaxSize 10typedef struct Node{    ElementType *Array;    int front;    int rear;} *Queue;QueueCreateQueue( int MaxSize ){    Queue PtrQ;    PtrQ = malloc(sizeof(struct Node ));    if(PtrQ == NULL)        printf("out of space ");    PtrQ->Array = malloc(sizeof( ElementType ) * MaxSize );    if(PtrQ == NULL )        printf("out of space ");    PtrQ->front = 0;    PtrQ->rear = 0;    return PtrQ;}int IsFull( Queue PtrQ ){    return (rear+1) % MaxSize == front;}voidAddQ(ElementType X, Queue PtrQ){    if( IsFull( PtrQ ) )    {        printf("隊列滿");        return;    }    PtrQ->rear = (Q->rear + 1) % MaxSize;    PtrQ->Array[PtrQ->rear] = X;}intIsEmpty(Queue PtrQ ){    return PtrQ->rear == PtrQ->front;}ElementTypeDeleteQ( Queue PtrQ ){    if( IsEmpty( PtrQ ) )    {        printf("隊列空")；        return;    }    PtrQ->front = (PtrQ->front + 1) % MaxSize;    return PtrQ->Array[PtrQ->front];}

View Code

 

隊列的順序儲存表示---數組實現