我用VC6.0++写了段循环队列代码,但是代码出现问题,不知道哪里出错,求高手解答
#include"stdio.h"#include"malloc.h"typedefstructQueue{int*pBase;intfront;intrear;}QUE...
# include "stdio.h"# include "malloc.h"
typedef struct Queue{
int * pBase;
int front;
int rear;
}QUEUE;
void init(QUEUE * pQ);bool full_queue(QUEUE * pQ);
bool en_queue(QUEUE * pQ,int val);
void traverse_queue(QUEUE * pQ);
int main (void){
QUEUE Q;
init(&Q);
en_queue(&Q,1);
traverse_queue(&Q);
return 0;}
void init(QUEUE * pQ){
pQ->pBase = (int *)malloc(sizeof(int) * 6);
pQ->front = 0;
pQ->rear = 0;
}bool full_queue(QUEUE * pQ)
{
if((pQ->rear + 1) % 6 == pQ->front)
return true;
else
return false;
}
bool en_queue(QUEUE * pQ,int val)
{
if(full_queue(pQ))
return false;
else
{
pQ->pBase[pQ->rear] = val;
pQ->rear = (pQ->rear+1) % 6;
return true;
}
void traverse_queue(QUEUE * pQ)
{
int i = pQ->front;
while(i != pQ->rear)
{
printf("%d ",pQ->pBase[i]);
i = (i+1) % 6;
} printf("\n");
return 0;
}
求解答!!! 展开
typedef struct Queue{
int * pBase;
int front;
int rear;
}QUEUE;
void init(QUEUE * pQ);bool full_queue(QUEUE * pQ);
bool en_queue(QUEUE * pQ,int val);
void traverse_queue(QUEUE * pQ);
int main (void){
QUEUE Q;
init(&Q);
en_queue(&Q,1);
traverse_queue(&Q);
return 0;}
void init(QUEUE * pQ){
pQ->pBase = (int *)malloc(sizeof(int) * 6);
pQ->front = 0;
pQ->rear = 0;
}bool full_queue(QUEUE * pQ)
{
if((pQ->rear + 1) % 6 == pQ->front)
return true;
else
return false;
}
bool en_queue(QUEUE * pQ,int val)
{
if(full_queue(pQ))
return false;
else
{
pQ->pBase[pQ->rear] = val;
pQ->rear = (pQ->rear+1) % 6;
return true;
}
void traverse_queue(QUEUE * pQ)
{
int i = pQ->front;
while(i != pQ->rear)
{
printf("%d ",pQ->pBase[i]);
i = (i+1) % 6;
} printf("\n");
return 0;
}
求解答!!! 展开
2个回答
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询