顺序队列的基本操作（进行了修改解决了假溢出问题）

#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 5

typedef int ElemType;
//队列结构体 
typedef struct{
    ElemType data[MAXSIZE];
    int front,rear;//队头与队尾指针 (实际就是两个变量)
}SqQueue; 
//初始化顺序队列
int InitQueue(SqQueue *S){
    S->front=S->rear=0;
    //指针赋0，就是不指向任何对象，相当于NULL。 
}
//销毁队列
int  DestroyQueue(SqQueue *S){
    
}
//判断队列为空
int IsEmpty(SqQueue *S){
    if(S->front==S->rear){
        return 1;
    }
    return 0;
} 
//判断队列以满
//int IsFull(SqQueue *S){
//    if(S->rear==MAXSIZE&&S->front==0){
//        return     printf("队满\n");;
//    }else if(S->rear==MAXSIZE&&S->front!=0){
//       return printf("队满,但队内前端依然有空位\n"); 
//    }
//    return 0; 
//} 

//进队运算算法
int EnQueue(SqQueue *S){
    if(S->rear==MAXSIZE&&S->front==0){
        return     printf("队满\n");;
    }else if(S->rear==MAXSIZE&&S->front!=0){
       return printf("队满,但队内前端依然有空位\n出现假溢出现象\n"); 
    } 
    int n;
    printf("请输入你想入队的值\n");
    scanf("%d",&n); 
    S->data[S->rear]=n; 
    S->rear=S->rear+1;
//    S->front=S->front+1;
    return printf("进队成功\n");
}
//输出队列元素
int DisElem(SqQueue *S){
    if(IsEmpty(S)){
        return printf("队内是空无法输出\n");
    }
    int i=S->front;//i=0
    printf("队内元素有:\n"); 
    for(int n=0;i<S->rear;n++){
        printf("%3d",S->data[i]);
        i++;
    }
    printf("\n");
    return printf("输出成功");
}
//获取队首元素
int GetHead(SqQueue *S){
    if(IsEmpty(S)){
        return printf("队内是空\n");
    }
    return printf("队首元素为\n%d",S->data[S->front]); 
}
int GetLength(SqQueue *S){
    if(IsEmpty(S)){
        return printf("队内为空\n");
    }
    return printf("队的长度为%d",S->rear); 
    
}
//出队
int DeleteQueue(SqQueue *S){
    if(IsEmpty(S)){
        return printf("队内是空无法输出\n");
    }
      int x;
//    SqQueue *temp=S->front;
      x=S->data[S->front];
      S->front=S->front+1;
      return printf("出队的元素为%d\n",x);
}
//使前端空位补上解决假溢出问题 
int FrontQueue(SqQueue *S){
    if(S->rear==MAXSIZE&&S->front!=0){
        int n;
        while(S->front!=0){
        S->front=S->front-1;
        printf("请输入你想入队的数\n");
        scanf("%d",&n);
        S->data[S->front]=n;
      }
      printf("你已经成功填补空位"); 
    }
    return printf("现在未出现假溢出现象\n");
} 
int main(){
    SqQueue S;
    int n;
    InitQueue(&S);
    while(true){
  printf("|||||||||||||||||||||||||||||||||||||||||||||||\n");
  printf("||  1：入队                                  ||\n");
  printf("||  2：查看队伍元素                          ||\n");
  printf("||  3：查看队首元素                          ||\n");
  printf("||  4：查看队列长度                          ||\n");
  printf("||  5：出队                                  ||\n");
  printf("||  6：使前端空位补上解决假溢出问题          ||\n");
  printf("||  (输入-1退出系统)                         ||\n");
  printf("|||||||||||||||||||||||||||||||||||||||||||||||\n");
        
        printf("请输入你的操作序号\n");
        scanf("%d",&n);
        switch(n){
            case 1:
                EnQueue(&S);
                break;
            case 2:
                DisElem(&S);
                break;
            case 3:
                GetHead(&S);
                break;
            case 4:
                GetLength(&S);
                break;
            case 5:
                DeleteQueue(&S);
                break;
            case 6:
                FrontQueue(&S);
                break;        
            case -1:
                return 0;     
            
        }
        
    } 
}