自编停车场问题.doc

自编停车场问题！ 自己编写的停车场问题，一起来讨论一下如何修改会更好吧！！！ 代码如下：#includestdio.h#includestdlib.h#define MaxStackSize 2??????????????/*栈的最大值*/#define MaxQueueSize 100???????????? /*队列的最大值*/#define money 2????????????????????? /*停车场每小时的费用*/typedef struct???????????????????????/*车的数据结构*/{int num;float time;}CarType;/*定义栈*/typedef struct???????????????????????/*定义堆栈*/{CarType stack[MaxStackSize];int top;}SeqStack;void StackInitate(SeqStack *S)?????? /*初始化堆栈*/{S-top=0;}int stackfull(SeqStack S)????????????/*判断栈是否满*/{if(S.top=MaxStackSize)??? return 1;else return 0;}int StackNotEmpty(SeqStack S)????????/*判断是否为非空栈*/{if(S.top=0) return 0;else return 1;}int StackPush(SeqStack *S,CarType x)??? /*入栈*/{if(S-top=MaxStackSize)??? {printf(堆栈已满无法插入！\n);?????return 0;??? }else??? {S-stack[S-top]=x;?????S-top++;?????return 1;??? }}int StackPop(SeqStack *S,CarType *d)???/*出栈*/{if(S-top=0)??? {printf(堆栈已空无数据元素出栈！\n);?????return 0;??? }else??? {S-top--;?????*d=S-stack[S-top];?????return 1;??? }}int StackTop(SeqStack S,CarType *d)??/*取栈顶元素*/{if(S.top=0)??? {printf(堆栈已空！\n);?????return 0;??? }else??? {*d=S.stack[S.top-1];?????return 1;??? }}/*定义队列*/typedef struct{??CarType queue[MaxQueueSize];??int rear;???????????? /*队尾指针*/??int front;??????????????? /*队头指针*/??int count;????????????/*计数器*/} SeqCQueue; void QueueInitiate(SeqCQueue *Q)/*初始化顺序循环队列Q*/{Q-rear = 0;??????/*定义初始队尾指针下标值*/???Q-front = 0;??? /*定义初始队头指针下标值*/??? Q-count = 0;???/*定义初始计数器值*/}int QueueNotEmpty(SeqCQueue *Q){if(Q-count==0 Q-rear == Q-front)?????return 0;else return 1;??? }int QueueAppend(SeqCQueue *Q, CarType x)??????/*入队*/{???if(Q-count 0 Q-rear == Q-front)??? {???printf(便道已满无法插入! \n);????????return 0;???}??? else??? {???Q-queue[Q-rear] = x;????????Q-rear = (Q-rear + 1) % MaxQueueSize;????????Q-count++;????????return 1;???}}int QueueDelete(SeqCQueue *Q, CarType *d)?????/*出队*/{???if(Q-count == 0) ??? {printf(队列已空无数据元素出队列!