main.cpp

数据结构 停车场管理 栈和队列的应用 双栈 停车场 便道问题

#include <iostream>
#include "cheku.h"
#include "biandao.h"
#include <stdlib.h>
using namespace std;


void main()
{
	cheku s1(6);
    cheku s2(6);
	biandao D1;
	while(1)
	{   
		int n;
		cout<<"*****************车库管理*******************"<<endl;
		cout<<"请输入你要选择的功能序号：";
		cout<<"1.停车"<<"2.取车"<<"3.退出"<<endl;
		cin>>n;
		switch(n)
		{
		case 1:
			if(s1.Full())
			{
			cout<<"请输入要停车的起始时间:"<<endl;
			int m;
			cin>>m;
			s1.ruku(m);
			int a;
            cout<<"请输入要停车的五位数车牌号码(不足五位补零):"<<endl;
			cin>>a;
		    s1.ruku(a);
			}
			else
			{
				    cout<<"无空车位，请进入便道"<<endl;
                    cout<<"请输入要停车的五位数车牌号码(不足五位补零):"<<endl;
					int z;
					cin>>z;
                    D1.Enbiandao(z);
			}
			break;
	    case 2:

			cout<<"请输入要取车的五位数车牌号码(不足五位补零):"<<endl;
            int p;
			cin>>p;
			int i;
			i=s1.top;
			if(s1.Find(p)>0)
			{
			while(i!=s1.Find(p))
			{
	            s2.ruku(s1.chuku());
				s2.ruku(s1.chuku());
				i=s1.top;             //Pop后top--完毕
			}
			cout<<"输入出停车场当前时间："<<endl;
			int b;
			cin>>b;
            cout<<"车牌为"<<" "<<s1.chuku()<<" ";
			cout<<"应缴纳的停车费为"<<" "<<10*(b-s1.chuku())<<"元"<<endl;
            while(s2.top!=-1)
			{
				s1.ruku(s2.chuku());
                s1.ruku(s2.chuku());
			}
            if(D1.Empty()!=0)
			{
                    int m;
					m=D1.Debiandao();
				    cout<<"便道车牌为"<<m<<"汽车进停车场!";				
			        cout<<"请输入要停车的起始时间:"<<endl;
			        int a;
			        cin>>a;
		            s1.ruku(a);
			        s1.ruku(m);
			break;
			}
			else
				break;
			}
			else
				cout<<"不好意思!车库无此车!"<<endl;
			break;
		case 3:
			exit(1);
		}
	}
}