?? seqqueue.h
字號:
#include"stdio.h"
#include"stdlib.h"
typedef struct
{
DataTypeQ queue[MaxQueueSize];
int rear;
int front;
int count;
}SeqQueue;
void QueueInitiate( SeqQueue *Q )
{
Q->rear = 0;
Q->front = 0;
Q->count = 0;
}
int QueueNotEmpty( SeqQueue Q )
{
if( Q.count == 0 )
return 0;
else
return 1;
}
int QueueAppend( SeqQueue *Q, DataTypeQ x )
{
if( MaxQueueSize == Q->count )
{
printf("\n\nThe queue is full!\n");
return 0;
}
else
{
Q->queue[Q->rear] = x;
Q->rear = (Q->rear+1) % MaxQueueSize;
Q->count ++;
return 1;
}
}
int QueueDelete( SeqQueue *Q, DataTypeQ *x )
{
if( 0 == Q->count )
{
printf("\n\nThe queue is empty!\n");
return 0;
}
else
{
*x = Q->queue[Q->front];
Q->front = (Q->front + 1) % MaxQueueSize;
Q->count --;
return 1;
}
}
int QueueGet( SeqQueue Q, DataTypeQ *x )
{
if( 0 == Q.count )
{
printf("\n\nThe queue is empty!\n");
return 0;
}
else
{
*x = Q.queue[Q.front];
return 1;
}
}
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -