数据结构——队列之顺序存储

淩亂°似流年 2022-06-17 01:38 211阅读 0赞

# 数据结构——队列之顺序存储 #

用数组描述队列的顺序存储，需要两个变量用来标记队首和队尾元素的数组下标：

![20170412202446817][]

#include <stdio.h>
    #include <stdlib.h>
    #include <malloc.h>
    #include <string.h>
    /**队列的循环顺序存储**/
    #define Max_Size 2
    typedef struct Data{
    	char name[10];
    	int age;
    };
    typedef struct Queue{
    	Data data[Max_Size];
    	int front;		//指向队首元素
    	int rear;		//指向队尾元素
    	int len;
    };
    /**初始化空队列**/
    void InitQueue(Queue *Q){
    	Q->front = Q->rear = 0;
    	Q->len = 0;
    }
    /**判断是否为空队列**/
    int QueueEmpty(Queue Q){
    	//为空返回1否则返回0
    	if(Q.len==0) return 1;
    	else return 0;
    }
    /**返回队首元素**/
    int GetFront(Queue Q,Data *d){
    	if(QueueEmpty(Q)==1){
    		printf("It's an empty stack!\n");
    		return 0;
    	}else{
    		strcpy(d->name,Q.data[Q.front].name);
    		d->age = Q.data[Q.front].age;
    		return 1;
    	}
    }
    /**从队尾插入新元素 入队**/
    void PushQueue(Queue *Q,Data d){
    	if(Q->len==Max_Size){
    		printf("Error!No space to insert!\n");
    		return;
    	}
    	if(Q->rear==Max_Size)
    		Q->rear = 0;
    	strcpy(Q->data[Q->rear].name,d.name);
    	Q->data[Q->rear].age = d.age;
    	Q->rear++;
    	Q->len++;
    }
    /**从队首删除元素 出队**/
    void PopQueue(Queue *Q,Data *d){
    	if(QueueEmpty(*Q)==1){
    		printf("It's an empty stack!\n");
    	}else{
    		strcpy(d->name,Q->data[Q->front].name);
    		d->age = Q->data[Q->front].age;
    		if(Q->front==Max_Size)
    			Q->front = 0;
    		Q->front++;
    		Q->len--;
    	}
    }
    /**清空队列**/
    void ClearQueue(Queue *Q){
    	if(QueueEmpty(*Q)==1){
    		printf("It's already an empty stack!\n");
    	}else{
    		Q->front = Q->rear = Q->len = 0;
    	}
    }
    /**打印栈内信息**/
    void PrintQueue(Queue Q){
    	if(QueueEmpty(Q)==1){
    		printf("It's an empty stack!\n");
    	}else{
    		printf("name----age\n");
    		int len = Q.len;
    		int i = Q.front;
    		int j = Q.rear;
    		if(i<j){
    			while(i<j){
    				printf("%s    %d\n",Q.data[i].name,Q.data[i].age);
    				i++;
    			}
    		}else{
    			for(;i<Max_Size;i++){
    				printf("%s    %d\n",Q.data[i].name,Q.data[i].age);
    			}
    			for(int n = 0;n<j;n++){
    				printf("%s    %d\n",Q.data[n].name,Q.data[n].age);
    			}
    		}
    	}
    }
    void main(){
    	Data d;
    	char name[10];
    	int code;
    	int age;
    	int i=1;
    	Queue Q;
    	while(i){
    		printf("1、初始化空队列\t2、入队\t3、出队\t4、队首元素5、清空队6、打印信息\n");
    		scanf("%d",&i);
    		switch (i){
    			case 1:
    				InitQueue(&Q);
    				break;
    			case 2:
    				printf("Input the name: ");
    				scanf("%s",&d.name);
    				printf("Input the age: ");
    				scanf("%d",&d.age);
    				PushQueue(&Q,d);
    				break;
    			case 3:
    				PopQueue(&Q,&d);
    				printf("Deleted (%s,%d)\n",d.name,d.age);
    				break;
    			case 4:
    				code = GetFront(Q,&d);
    				if(code) printf("Top element is (%s,%d)\n",d.name,d.age);
    				break;
    			case 5:
    				ClearQueue(&Q);
    				break;
    			case 6:
    				PrintQueue(Q);
    				break;
    			default:
    				break;
    		}
    	}
    	system("pause");
    }

[20170412202446817]: /images/20220617/a925c5ed71414a8aae23f376040bc9ed.png