帮忙找一下这个程序的错误 关于链表和栈

来源：百度知道 编辑：UC知道 时间：2024/05/10 09:50:14
#define N 3
#include<stdlib.h>
struct Stack{
char Array[N];
int top;
}StaN,*s;
s=&StaN;
void InitS(Stack *s){
*s->top=-1;
}
void InsertS(Stack *s){
while(s->top<N){
printf("please Enter a char:");
scanf("%c",&Array[s->top]);
s->top++;
}
}
void DeleteS(Stack *s){
while(s->top>0){
printf("%c",s->Array[s->top--]);
}
struct Queue{
char AArray[N];
int front;
int rear;
}QueN,*q=QueN;
void IntiQ(Queue *q){
q->front=q->rear=0;
}
void InsertQ(Queue *q){
if((q->rear+1)%N==q->front){
printf("Full!!!");
}return 0;\
while(q->rear<N){
printf("Please Enter character:");
scanf("%c",q->AArray[q-rear++];)
}
}
void DeleteQ(Queue* q){
if((q->rear+1)%N==q->front){
printf("Full!!"

//只把前面的定义部分给你修改了，后面的main里面要实现的功能自己再根据需要修改了
#define N 3
#include<stdlib.h>
#include <iostream>
using namespace std;
struct Stack
{
char Array[N];
int top;
Stack* s;
}StaN;

void InitS(Stack *s)
{
s->top=-1;
}
void InsertS(Stack *s)
{
while(s->top<N)
{
printf("please Enter a char:");
scanf("%c",&StaN.Array[s->top]);
s->top++;
}
}

void DeleteS(Stack *s)
{
while(s->top>0)
{
printf("%c",s->Array[s->top--]);
}
}

struct Queue
{
char AArray[N];
int front;
int rear;
Queue* q;
}QueN;

void InitQ(Queue *q)
{
q->front=q->rear=0;
}

void InsertQ(Queue *q)
{
if((q->rear+1)%N==q->front)
{
printf("Full!!!");