火车调度c语言程序实现代码

1、#define MAXSIZE 100/*栈 、队列的最大容量，设为 100 */ #include <>#include <>typedef char datatype;typedef struct datatype stackMAXSIZE; /* 装载栈的向量 */int top; /* 栈顶指针 */ seqstack; /* 顺序栈类型定义 */ typedef struct datatype queueMAXSIZE;/* MAXSIZE为队列的最大长度 */int front;int rear; sequeue; /* 顺序队列类型定义 */void se

2、tstacknull(seqstack *s ) /* 置空栈 */ s->top=-1; datatype pop(seqstack *s ) /* 出栈 */ if (s->top<0 ) printf( "stack empty ！ n" ); return('0');else s->top-;/*产 生新栈顶指针 */return(s->stacks->top+1); /* 返回原栈顶元素值 */int empty(seqstack *s) /* 判断是否为空栈 */if (s->top<0 ) ret

3、urn(1);else return(0);void push(seqstack *s,datatype x) /* 入栈 */ if ( s->top>=MAXSIZE-1 )/*上 溢 */printf( "stack overflow ！ n" );else s->top=s->top+1; /* 1. 栈顶指针加 1 */s->stacks->top=x; /* 2. 新元素入栈 */void setseqnull(sequeue *sq) /* 置空队列 */sq->front=-1; sq->rear=-1;voi

4、d encyque(sequeue *sq,datatype x) /* 入队 */if(sq->rear+1)%MAXSIZE=sq->front)printf( "queue overflow ！ n" );else sq->rear=(sq->rear+1)%MAXSIZE; sq->queuesq->rear=x;datatype delcyque(sequeue *sq) /* 出队 */if(sq->front=sq->rear)return(NULL);else sq->front=(sq->fron

5、t+1)%MAXSIZE; return(sq->queuesq->front);main( )seqstack *st;sequeue *trainsq;char ch, trainsMAXSIZE,*p=trains;st=(seqstack *)malloc(sizeof(seqstack); trainsq=(sequeue *)malloc(sizeof(sequeue); setstacknull(st);setseqnull(trainsq);printf("enter train serious:n");gets(trains);putchar(

6、'n');ch=*p;while (ch!='0') ch=*p;if (ch='L') push(st,ch);ch=pop(st);encyque(trainsq,ch);elsepush(st,ch); p=p+1;int i=0;p=trains;while(!empty(st) ch=pop(st);if(ch='Q')encyque(trainsq,ch);else*p=ch;p+;i+;if(i>=0)ch=trainsi;push(st,ch);ch=pop(st);encyque(trainsq,ch);i-;printf