停车位代码.doc

停车位代码#include "" #define N3 #define M5 #define Null 0 #define True 1 #define False 0 typedef struct { int num; int arrtime; }elemtype; typedef struct { elemtype stack[N]; int top; }sqstktp; typedef struct node { int num; struct node * next; }queueptr; typedef struct { queueptr * front,*rear; }linkedquetp; void inistack(sqstktp*s) { s->top=-1; } int push (sqstktp * s,elemtype x) { if (s->top==N-1) return(False); else {s->stack[++s->top]=x; return(True); }} elemtype pop(sqstktp * s) { elemtype x; if(s->top<0) { =Null; =Null; return(x); } else { s->top--; return(s->stack[s->top+1]); }} void inilinkedque(linkedquetp * s) { s->front=(queueptr * )malloc(sizeof(queueptr)); s->rear=s->front; s->front->next=Null; s->front->num=0; } void enlinkedque(linkedquetp * s,int num1) { queueptr * p; p=(queueptr *)malloc(sizeof(queueptr)); p->num=num1; p->next=Null; s->rear->next=p; s->rear=p; s->front->num++; } int dllinkedque(linkedquetp * s) { queueptr * p; int n; if(s->front==s->rear) return (Null); else { p=s->front->next; s->front->next=p->next; if(p->next==Null) s->front->next=p->next; if(p->next==Null) s->rear=s->front; n=p->num; free(p); s->front->num--; return (n); }} void arrive(sqstktp *s1,linkedquetp * p,elemtype x) { int f; f=push(s1,x); if(f==False) { enlinkedque(p,); printf(" 第%d 号车停在便道第%d 号车位上\n",,p->front->num); } else printf(" 第%d 号车停在便道第%d 号车位上\n"