Question

大神帮忙看一下 我的这个程序那里有问题啊 程序不能输出结构 实现将环形队列倒置的功能

#include<stdio.h>
#include<stdlib.h>
#define Maxsize 50
typedef char ElemType;
typedef struct
{
ElemType data[Maxsize];
int front,rear;
}SqQueue;

void InitQueue(SqQueue *&q)
{
q=(SqQueue*)malloc(sizeof(SqQueue));
q->front=q->rear=0;
}
int insert(SqQueue *&q,char *a)

{ int i;
if((q->rear+1)%Maxsize==q->front)
return 0;
for(i=0;i<7;i++)
q->data[q->rear]=a[i];
q->rear=(q->rear+1)%Maxsize;

return 1;
}
void ClearQueue(SqQueue *&q)
{
free(q);
}

void dispQueue(SqQueue *q)
{
if(q->front!=q->rear)

printf("输出环形队列:\n");

printf("%c",q->data[q->front]);
q->front=(q->front+1)%Maxsize;
}

int Exchange(SqQueue *&q)
{
int n=(q->rear-q->front+Maxsize)%Maxsize;
if(q->front==q->rear)
return 0;
else
while(q->front<=n/2)
{ char temp;
temp=q->data[q->front];
q->data[q->front]=q->data[q->rear];
q->data[q->rear]=temp;
q->front=(q->front+1)%Maxsize;
}
return 1;
}
void main()
{
SqQueue *q;

char a[7]={'a','b','c','d','e','f'};
InitQueue( q);

insert(q,a);

dispQueue(q);
Exchange(q);

dispQueue(q);
}

Answer 1

你看下这样对不
#include<stdio.h>
#include<stdlib.h>
#define Maxsize 50
typedef char ElemType;
typedef struct
{
ElemType data[Maxsize];
int front,rear;
}SqQueue;

void InitQueue(SqQueue *&q)
{
q=(SqQueue*)malloc(sizeof(SqQueue));
q->front=q->rear=0;
}
int insert(SqQueue *&q,char *a)

{ int i;
if((q->rear+1)%Maxsize==q->front)
return 0;
for(i=0;i<6;i++)
{
q->data[q->rear]=a[i];
q->rear=(q->rear+1)%Maxsize;
}

return 1;
}
void ClearQueue(SqQueue *&q)
{
free(q);
}

void dispQueue(SqQueue *q)
{
int i;
if(q->front!=q->rear)
//printf("%d_%d\n",q->rear,q->front);
printf("输出环形队列:\n");
for(i=0;i<6;i++)
{
printf("%c",q->data[i]);
}
printf("\n"); //printf("%c",q->data[q->front]);
//q->front=(q->front+1)%Maxsize;
}

int Exchange(SqQueue *&q)
{
int n=(q->rear-q->front+Maxsize)%Maxsize;
if(q->front==q->rear)
return 0;
int j = q->front;
int k = q->rear-1;
while(j<k)
{ char temp;
temp=q->data[j];
q->data[j]=q->data[k];
q->data[k]=temp;
j++;
k--;
}
return 1;
}
int main()
{
SqQueue *q;

char a[7]={'a','b','c','d','e','f'};
InitQueue( q);

insert(q,a);

dispQueue(q);
Exchange(q);

dispQueue(q);
}