队列比较简单,与顺序栈的区别就是先进先出
代码可编译运行
//2020.3.30 by大彪不爱嚼米饭粒儿
//Init 初始化
//In 入队
//Out 出队
//Print 打印
//Length 求队-长
#include<stdio.h>
#include <stdlib.h>
#define MAXSIZE 100
typedef struct sequence
{
int quence[MAXSIZE];
int front; //队头
int rear; //队尾
}Sequence;
void Init(Sequence *S)
{
S->front =S->rear =0;
}
int Length(Sequence S)
{
return (S.rear-S.front+MAXSIZE)%MAXSIZE;
}
int In(Sequence *S,int e)
{
if(S->rear>=MAXSIZE)
{
printf</