互联网站备案信息seo成功案例分析

数据结构之循环队列的顺序结构基本操作-基本结构-初始化-入队-出队-判断队列是否为空-获取队头元素

满队列:(rear+1)%MAXSIZE==front

队尾:(rear+1)%MAXSIZE

#include <stdio.h>
#include <stdlib.h>#define MAXSIZE 100
typedef int ElemType;typedef struct 
{ElemType *data;int front;int rear;}Queue;//初始化
Queue* initQueue()
{Queue *q = (Queue*)malloc(sizeof(Queue));q->data = (ElemType*)malloc(sizeof(ElemType) * MAXSIZE);q->front = 0;q->rear = 0;return q;
}//判断队列是否为空
int isEmpty(Queue *Q)
{if (Q->front == Q->rear){printf("空的\n");return 1;}else{return 0;	}
}//入队
int equeue(Queue *Q, ElemType e)
{if ((Q->rear + 1) % MAXSIZE == Q->front){printf("满了\n");return 0;}Q->data[Q->rear] = e;Q->rear = (Q->rear + 1) % MAXSIZE;return 1;
}//出队
int dequeue(Queue *Q, ElemType *e)
{if (Q->front == Q->rear){printf("空的\n");return 0;}*e = Q->data[Q->front];Q->front = (Q->front + 1) % MAXSIZE;return 1;
}//获取队头元素
int getHead(Queue *Q, ElemType *e)
{if (Q->front == Q->rear){printf("空的\n");return 0;}*e = Q->data[Q->front];return 1;
}int main()
{Queue *q = initQueue();equeue(q, 10);equeue(q, 20);equeue(q, 30);equeue(q, 40);equeue(q, 50);//入队10，20，30，40，50ElemType e;dequeue(q, &e);//出队printf("%d\n",e);dequeue(q, &e);//出队printf("%d\n",e);getHead(q, &e);//获取队头printf("%d\n",e);return 0;
}

运行：